Systems and methods for providing quality of service precedence in TCP congestion control

ABSTRACT

Systems and methods for dynamically controlling bandwidth of connections are described. In some embodiments, a proxy for one or more connections may allocate, distribute, or generate indications of network congestion via one or more connections in order to induce the senders of the connections to reduce their rates of transmission. The proxy may allocate, distribute, or generate these indications in such a way as to provide quality of service to one or more connections, or to ensure that a number of connections transmit within an accepted bandwidth limit. In other embodiments, a sender of a transport layer connection may have a method for determining a response to congestion indications which accounts for a priority of the connection. In these embodiments, a sender may reduce or increase parameters related to transmission rate at different rates according to a priority of the connection.

FIELD OF THE INVENTION

The present invention generally relates to data communication networks.In particular, the present invention relates to systems and methods fordynamically controlling bandwidth by a proxy of one or more connections.

BACKGROUND OF THE INVENTION

In networking, quality-of-service (QoS) systems may be used to specifythe precedence of competing packet flows. In some cases these flows maybe a simple connection between a sender and a receiver. In other casesthese flows may be a connection between a sender and receiver thatpasses through one or more proxies, some or all of which may betransparent to the sender and receiver. Standardized QoS signalingmechanisms exist, such the TOS (“Type of Service,” RFC 1349) and laterthe DSCP (“Differentiated Services Codepoint,” RFC 2474, RFC 2475) bitsin the IP header. However, these may not be deployed across networks ina consistent way, however, and their presence or characteristics cannotbe relied upon except when the same administrator controls the entirenetwork. When data traverses networks owned by a third party, which ismay be the case in wide-area networks (and especially the Internet), insome cases only the most basic IP functionality can be assumed, and thatthe bottleneck gateway will ignore any QoS bits in the packets.

QoS is often implemented at a bandwidth bottlenecks. These bottleneckssometimes occur at a fast-to-slow transitions in network speed, forexample at a device bridging a LAN and a WAN. If there is a backlog ofpackets from different flows at a device, the device can make a decisionusing QoS about which flow should have a packet sent next. Intraditional QoS, equalizing bandwidth between connections may beaccomplished with fair queuing, provided that other circumstances (suchas excessive losses) do not prevent a connection from achieving its fairbandwidth share. In some implementations of fair queuing, eachconnection has its own queue. When the total amount of queuing becomesexcessive, a packet is dropped from the connection with the longestqueue. Because of the nature of fair queuing (which outputs packets on around-robin basis), the connection with the longest queue is the that isexceeding its fair bandwidth share by the largest margin. Droppingpackets from connections going too fast, rather than randomly, mayreduce the unfairness between connections. Connections that areincapable of using their fair bandwidth share may never be targeted,while those that continually exceed it may see a much higher loss rate.

However, this QoS approach may be dependent on having a backlog ofpackets across a number of flows, which may be inappropriate in caseswhere backlog is sought to be minimized due to other concerns. These QoSmechanisms also may not apply in cases involving a single flow. Thusthere exists a need for systems and methods which allow QoS to beimplemented in cases where minimal or no backlog of packets exists, andwith respect to single flows. These systems and methods should beapplicable even in cases where parts of the network which a flowtraverses are under the control of a third party.

Many network traffic uses the Transport Control Protocol (TCP) protocol,which is a connection-based layer on top of IP. TCP uses a mechanism ofslowing down the sending rate when the loss of a packet is detected, andspeeding up when there is no such loss. Traditional implementations(such as TCP Reno) may use a sample time of one round-trip over thenetwork (RTT, the time between sending a packet and receiving anacknowledgement of its arrival from the receiving unit). In a round-tripin which no packets were lost, the amount of data in flight (thecongestion window) may be increased by one full-sized packet. Increasingthe congestion window will increase the connection bandwidth, thenetwork queuing, the packet-loss rate, or some combination ofthese—depending on the state of the network. An alternative method ofachieving congestion control in TCP is to use the round-trip time as thebasic control signal. This is used by TCP Vegas and FAST TCP. In FASTTCP, for instance. In these implementations, the congestion window maybe increased or decreased based on a comparison of a recent packet roundtrip time against a fastest or average round trip time.

The use of random losses to control connection speed may lead tounfairness in bandwidth allocation between connections. Given twoconnections, one may receive less bandwidth because it is simplyunlucky, it passes over a link with an inherently higher loss rate (suchas a wireless network), or it may receive less bandwidth because it hasa longer path length (and hence a longer round-trip time) than itspartner. Because connections speed up once per round-trip, the ramp-uprate may be steeper with short-haul connections with long-haul ones.Further, TCP may be indiscriminate with respect to connection prioritiesin its slowing down and ramping up of connection bandwidths in responseto network events. There thus exists a need for systems and methodswhich can compensate for the potential unfairness of allocatingbandwidth based on random losses, and which allow for QoS priorities tobe factored into response to packet losses and other congestion events.

BRIEF SUMMARY OF THE INVENTION

The present invention is directed towards systems and methods fordynamically controlling bandwidth of connections. In some embodiments, aproxy for one or more connections may allocate, distribute, or generateindications of network congestion via one or more connections in orderto induce the senders of the connections to reduce their rates oftransmission. The proxy may allocate, distribute, or generate theseindications in such a way as to provide quality of service to one ormore connections, or to ensure that a number of connections transmitwithin an accepted bandwidth limit. In other embodiments, a sender of atransport layer connection may have a method for determining a responseto congestion indications which accounts for a priority of theconnection. In these embodiments, a sender may reduce or increaseparameters related to transmission rate at different rates according toa priority of the connection.

In a first aspect, the present invention relates to methods ofdistributing congestion events by a device among a plurality oftransport layer connections to dynamically alter effective bandwidthavailable to one or more of the transport layer connections. In oneembodiment, the method comprises establishing, by a device, a pluralityof transport layer connections, one or more of the transport layerconnections having an assigned priority; and receiving, by the device,via a first transport layer connection of the plurality of transportlayer connections, a first indication of network congestion. The devicemay then select, according to the assigned priorities, a secondtransport layer connection of the plurality of connections; andtransmit, in response to receiving the first indication, a secondindication of a congestion event via the second transport layerconnection. In other embodiments, the device may allocate congestionevents based on assigned bandwidths of the connections.

In a second aspect, the present invention relates to systems fordistributing congestion events by an intermediate appliance among aplurality of transport layer connections to dynamically alter effectivebandwidth available to one or more of the transport layer connections.In one embodiment, a network appliance serves as an intermediaryappliance to a plurality of transport layer connections, one or more ofthe transport layer connections having an assigned priority. The networkappliance may comprise a packet processor which receives, via a firsttransport layer connection of the plurality of transport layerconnections, a first indication of network congestion; and a flowcontroller which selects, according to the assigned priorities, a secondtransport layer connection of the plurality of connections; andtransmits, in response to receiving the first indication, a secondindication of a congestion event via the second transport layerconnection. In other embodiments, the device may allocate congestionevents based on assigned bandwidths of the connections.

In a third aspect, the present invention relates to methods forproviding, by an appliance, quality of service levels to transport layerdata communications using a transparent proxy to control connectionbandwidth. In one embodiment, a method comprises determining, by anappliance serving as a transparent proxy for a transport layerconnection between a sender and a receiver, that the rate oftransmission of the sender via the transport layer connection differsfrom a predetermined rate of transmission; generating, by the appliancein response to the determination, an acknowledgement packet containingan indication to alter the rate of transmission; and transmitting, bythe appliance to the sender, the generated acknowledgement packet. Inthis embodiment, the acknowledgement may be generated even if there wasno acknowledgement received from the receiver. The acknowledgement maycontain an indication either to increase or decrease the sender's rateof transmission, as appropriate.

In a fourth aspect, the present invention relates tocomputer-implemented systems for providing provide quality of servicelevels to transport layer data communications using a transparent proxyto control connection bandwidth. In one embodiment, a network applianceserves as a transparent proxy for a transport layer connection betweenone or more senders and one or more receivers. The network appliancecomprises a flow control module which determines the rate oftransmission of the sender via the transport layer connection differsfrom a predetermined rate of transmission; and generates, in response tothe determination, an acknowledgement containing an indication to alterthe rate of transmission. The network appliance may also comprise apacket processing module which transmits to the sender the generatedacknowledgement. The acknowledgement may contain an indication either toincrease or decrease the sender's rate of transmission, as appropriate.

In a fifth aspect, the present invention relates to methods fordynamically controlling connection bandwidth by a sender of one or moretransport layer connections according to a priority assigned to one ormore of the transport layer connections. In one embodiment, a methodcomprises: transmitting, by a sender, data via a first transport layerconnection, wherein the first transport layer connection has a firstcongestion window size identifying an amount data to be transmitted bythe sender in the absence of an acknowledgement from a receiver;receiving, by the sender via the first transport layer connection, anindication of a packet loss via the first transport layer connection;identifying a reduction factor, the reduction factor corresponding to apriority assigned by the sender to the first transport layer connection;determining a second congestion window size, the second congestionwindow size comprising the first congestion window size reduced by thereduction factor; and transmitting, by the sender via the firsttransport-layer connection, data according to the second congestionwindow size. In other embodiments a similar method may be applied wherea connection priority determines the rate in which congestion window isincreased in response to a time interval passing without an indicationof a packet loss being received.

In a sixth aspect, the present invention relates to systems fordynamically controlling connection bandwidth according to a priorityassigned to one or more transport layer connections by a networkappliance serving as an intermediary for the one or more transport layerconnections. In one embodiment a system comprises a network appliancewhich serves as an intermediary for a first transport layer connectionbetween a sender and a receiver. The network appliance may comprise apacket processing engine which transmits data via the first transportlayer connection, wherein the first transport layer connection has afirst congestion window size corresponding to the maximum amount ofunacknowledged data to be transmitted; and receives, via the firsttransport layer connection, an indication of a packet loss. The networkappliance may also comprise a flow control module in communication withthe packet processing engine which computes a reduction factor, thereduction factor corresponding to a priority assigned by the applianceto the first transport layer connection; computes a second congestionwindow size, the second congestion window size comprising the firstcongestion window size divided by the reduction factor; and transmits,via the first transport layer connection, data according to the secondcongestion window size. In other embodiments a similar system may beused where a connection priority determines the rate in which congestionwindow is increased in response to a time interval passing without anindication of a packet loss being received.

The details of various embodiments of the invention are set forth in theaccompanying drawings and the description below.

BRIEF DESCRIPTION OF THE DRAWINGS

The foregoing and other objects, aspects, features, and advantages ofthe invention will become more apparent and better understood byreferring to the following description taken in conjunction with theaccompanying drawings, in which:

FIG. 1A is a block diagram of an embodiment of a network environment fora client to access a server via one or more network optimizationappliances;

FIG. 1B is a block diagram of another embodiment of a networkenvironment for a client to access a server via one or more networkoptimization appliances in conjunction with other network appliances;

FIG. 1C is a block diagram of another embodiment of a networkenvironment for a client to access a server via a single networkoptimization appliance deployed stand-alone or in conjunction with othernetwork appliances;

FIGS. 1D and 1E are block diagrams of embodiments of a computing device;

FIG. 2A is a block diagram of an embodiment of an appliance forprocessing communications between a client and a server;

FIG. 2B is a block diagram of another embodiment of a client and/orserver deploying the network optimization features of the appliance;

FIG. 3 is a block diagram of an embodiment of a client for communicatingwith a server using the network optimization feature;

FIG. 4 is a block diagram of a sample TCP packet;

FIG. 5 is a block diagram of a system for distributing congestion eventsby a device among a plurality of transport layer connections;

FIG. 6 is a flow diagram of a method for distributing congestion eventsby a device among a plurality of transport layer connections;

FIG. 7 is a block diagram of a system for providing quality of servicelevels to transport connections using a transparent proxy to controlconnection bandwidth;

FIG. 8 is a flow diagram of a method for providing quality of servicelevels to transport connections using a transparent proxy to controlconnection bandwidth;

FIG. 9A is a block diagram of a system for dynamically controllingbandwidth by a sender of a plurality of transport layer connectionsaccording to priorities of the connections;

FIG. 9B is a flow diagram of a method for dynamically reducingconnection bandwidth by a sender of one or more transport layerconnections according to a priority assigned to one or more of theconnections; and

FIG. 9C is a flow diagram of a method for dynamically increasingconnection bandwidth by a sender of one or more transport layerconnections according to a priority assigned to one or more of theconnections.

The features and advantages of the present invention will become moreapparent from the detailed description set forth below when taken inconjunction with the drawings, in which like reference charactersidentify corresponding elements throughout. In the drawings, likereference numbers generally indicate identical, functionally similar,and/or structurally similar elements.

DETAILED DESCRIPTION OF THE INVENTION

For purposes of reading the description of the various embodiments ofthe present invention below, the following descriptions of the sectionsof the specification and their respective contents may be helpful:

-   -   Section A describes a network environment and computing        environment useful for practicing an embodiment of the present        invention;    -   Section B describes embodiments of a system and appliance        architecture for accelerating delivery of a computing        environment to a remote user;    -   Section C describes embodiments of a client agent for        accelerating communications between a client and a server; and    -   Section D describes embodiments of systems and methods for        efficiently handling network congestion.        A. Network and Computing Environment

Prior to discussing the specifics of embodiments of the systems andmethods of an appliance and/or client, it may be helpful to discuss thenetwork and computing environments in which such embodiments may bedeployed. Referring now to FIG. 1A, an embodiment of a networkenvironment is depicted. In brief overview, the network environment hasone or more clients 102 a-102 n (also generally referred to as localmachine(s) 102, or client(s) 102) in communication with one or moreservers 106 a-106 n (also generally referred to as server(s) 106, orremote machine(s) 106) via one or more networks 104, 104′, 104″. In someembodiments, a client 102 communicates with a server 106 via one or morenetwork optimization appliances 200, 200′ (generally referred to asappliance 200). In one embodiment, the network optimization appliance200 is designed, configured or adapted to optimize Wide Area Network(WAN) network traffic. In some embodiments, a first appliance 200 worksin conjunction or cooperation with a second appliance 200′ to optimizenetwork traffic. For example, a first appliance 200 may be locatedbetween a branch office and a WAN connection while the second appliance200′ is located between the WAN and a corporate Local Area Network(LAN). The appliances 200 and 200′ may work together to optimize the WANrelated network traffic between a client in the branch office and aserver on the corporate LAN.

Although FIG. 1A shows a network 104, network 104′ and network 104″(generally referred to as network(s) 104) between the clients 102 andthe servers 106, the clients 102 and the servers 106 may be on the samenetwork 104. The networks 104, 104′, 104″ can be the same type ofnetwork or different types of networks. The network 104 can be alocal-area network (LAN), such as a company Intranet, a metropolitanarea network (MAN), or a wide area network (WAN), such as the Internetor the World Wide Web. The networks 104, 104′, 104″ can be a private orpublic network. In one embodiment, network 104′ or network 104″ may be aprivate network and network 104 may be a public network. In someembodiments, network 104 may be a private network and network 104′and/or network 104″ a public network. In another embodiment, networks104, 104′, 104″ may be private networks. In some embodiments, clients102 may be located at a branch office of a corporate enterprisecommunicating via a WAN connection over the network 104 to the servers106 located on a corporate LAN in a corporate data center.

The network 104 may be any type and/or form of network and may includeany of the following: a point to point network, a broadcast network, awide area network, a local area network, a telecommunications network, adata communication network, a computer network, an ATM (AsynchronousTransfer Mode) network, a SONET (Synchronous Optical Network) network, aSDH (Synchronous Digital Hierarchy) network, a wireless network and awireline network. In some embodiments, the network 104 may comprise awireless link, such as an infrared channel or satellite band. Thetopology of the network 104 may be a bus, star, or ring networktopology. The network 104 and network topology may be of any suchnetwork or network topology as known to those ordinarily skilled in theart capable of supporting the operations described herein.

As depicted in FIG. 1A, a first network optimization appliance 200 isshown between networks 104 and 104′ and a second network optimizationappliance 200′ is also between networks 104′ and 104″. In someembodiments, the appliance 200 may be located on network 104. Forexample, a corporate enterprise may deploy an appliance 200 at thebranch office. In other embodiments, the appliance 200 may be located onnetwork 104′. In some embodiments, the appliance 200′ may be located onnetwork 104′ or network 104″. For example, an appliance 200 may belocated at a corporate data center. In one embodiment, the appliance 200and 200′ are on the same network. In another embodiment, the appliance200 and 200′ are on different networks.

In one embodiment, the appliance 200 is a device for accelerating,optimizing or otherwise improving the performance, operation, or qualityof service of any type and form of network traffic. In some embodiments,the appliance 200 is a performance enhancing proxy. In otherembodiments, the appliance 200 is any type and form of WAN optimizationor acceleration device, sometimes also referred to as a WAN optimizationcontroller. In one embodiment, the appliance 200 is any of the productembodiments referred to as WANScaler manufactured by Citrix Systems,Inc. of Ft. Lauderdale, Fla. In other embodiments, the appliance 200includes any of the product embodiments referred to as BIG-IP linkcontroller and WANjet manufactured by F5 Networks, Inc. of Seattle,Wash. In another embodiment, the appliance 200 includes any of the WXand WXC WAN acceleration device platforms manufactured by JuniperNetworks, Inc. of Sunnyvale, Calif. In some embodiments, the appliance200 includes any of the steelhead line of WAN optimization appliancesmanufactured by Riverbed Technology of San Francisco, Calif. In otherembodiments, the appliance 200 includes any of the WAN related devicesmanufactured by Expand Networks Inc. of Roseland, N.J. In oneembodiment, the appliance 200 includes any of the WAN related appliancesmanufactured by Packeteer Inc. of Cupertino, Calif., such as thePacketShaper, iShared, and SkyX product embodiments provided byPacketeer. In yet another embodiment, the appliance 200 includes any WANrelated appliances and/or software manufactured by Cisco Systems, Inc.of San Jose, Calif., such as the Cisco Wide Area Network ApplicationServices software and network modules, and Wide Area Network engineappliances.

In some embodiments, the appliance 200 provides application and dataacceleration services for branch-office or remote offices. In oneembodiment, the appliance 200 includes optimization of Wide Area FileServices (WAFS). In another embodiment, the appliance 200 acceleratesthe delivery of files, such as via the Common Internet File System(CIFS) protocol. In other embodiments, the appliance 200 providescaching in memory and/or storage to accelerate delivery of applicationsand data. In one embodiment, the appliance 205 provides compression ofnetwork traffic at any level of the network stack or at any protocol ornetwork layer. In another embodiment, the appliance 200 providestransport layer protocol optimizations, flow control, performanceenhancements or modifications and/or management to accelerate deliveryof applications and data over a WAN connection. For example, in oneembodiment, the appliance 200 provides Transport Control Protocol (TCP)optimizations. In other embodiments, the appliance 200 providesoptimizations, flow control, performance enhancements or modificationsand/or management for any session or application layer protocol. Furtherdetails of the optimization techniques, operations and architecture ofthe appliance 200 are discussed below in Section B.

Still referring to FIG. 1A, the network environment may includemultiple, logically-grouped servers 106. In these embodiments, thelogical group of servers may be referred to as a server farm 38. In someof these embodiments, the servers 106 may be geographically dispersed.In some cases, a farm 38 may be administered as a single entity. Inother embodiments, the server farm 38 comprises a plurality of serverfarms 38. In one embodiment, the server farm executes one or moreapplications on behalf of one or more clients 102.

The servers 106 within each farm 38 can be heterogeneous. One or more ofthe servers 106 can operate according to one type of operating systemplatform (e.g., WINDOWS NT, manufactured by Microsoft Corp. of Redmond,Wash.), while one or more of the other servers 106 can operate onaccording to another type of operating system platform (e.g., Unix orLinux). The servers 106 of each farm 38 do not need to be physicallyproximate to another server 106 in the same farm 38. Thus, the group ofservers 106 logically grouped as a farm 38 may be interconnected using awide-area network (WAN) connection or metropolitan-area network (MAN)connection. For example, a farm 38 may include servers 106 physicallylocated in different continents or different regions of a continent,country, state, city, campus, or room. Data transmission speeds betweenservers 106 in the farm 38 can be increased if the servers 106 areconnected using a local-area network (LAN) connection or some form ofdirect connection.

Servers 106 may be file servers, application servers, web servers, proxyservers, and/or gateway servers. In some embodiments, a server 106 mayhave the capacity to function as either an application server or as amaster application server. In one embodiment, a server 106 may includean Active Directory. The clients 102 may also be referred to as clientnodes or endpoints. In some embodiments, a client 102 has the capacityto function as both a client node seeking access to applications on aserver and as an application server providing access to hostedapplications for other clients 102 a-102 n.

In some embodiments, a client 102 communicates with a server 106. In oneembodiment, the client 102 communicates directly with one of the servers106 in a farm 38. In another embodiment, the client 102 executes aprogram neighborhood application to communicate with a server 106 in afarm 38. In still another embodiment, the server 106 provides thefunctionality of a master node. In some embodiments, the client 102communicates with the server 106 in the farm 38 through a network 104.Over the network 104, the client 102 can, for example, request executionof various applications hosted by the servers 106 a-106 n in the farm 38and receive output of the results of the application execution fordisplay. In some embodiments, only the master node provides thefunctionality required to identify and provide address informationassociated with a server 106′ hosting a requested application.

In one embodiment, a server 106 provides functionality of a web server.In another embodiment, the server 106 a receives requests from theclient 102, forwards the requests to a second server 106 b and respondsto the request by the client 102 with a response to the request from theserver 106 b. In still another embodiment, the server 106 acquires anenumeration of applications available to the client 102 and addressinformation associated with a server 106 hosting an applicationidentified by the enumeration of applications. In yet anotherembodiment, the server 106 presents the response to the request to theclient 102 using a web interface. In one embodiment, the client 102communicates directly with the server 106 to access the identifiedapplication. In another embodiment, the client 102 receives applicationoutput data, such as display data, generated by an execution of theidentified application on the server 106.

Deployed with Other Appliances.

Referring now to FIG. 1B, another embodiment of a network environment isdepicted in which the network optimization appliance 200 is deployedwith one or more other appliances 205, 205′ (generally referred to asappliance 205 or second appliance 205) such as a gateway, firewall oracceleration appliance. For example, in one embodiment, the appliance205 is a firewall or security appliance while appliance 205′ is a LANacceleration device. In some embodiments, a client 102 may communicateto a server 106 via one or more of the first appliances 200 and one ormore second appliances 205.

One or more appliances 200 and 205 may be located at any point in thenetwork or network communications path between a client 102 and a server106. In some embodiments, a second appliance 205 may be located on thesame network 104 as the first appliance 200. In other embodiments, thesecond appliance 205 may be located on a different network 104 as thefirst appliance 200. In yet another embodiment, a first appliance 200and second appliance 205 is on the same network, for example network104, while the first appliance 200′ and second appliance 205′ is on thesame network, such as network 104″.

In one embodiment, the second appliance 205 includes any type and formof transport control protocol or transport later terminating device,such as a gateway or firewall device. In one embodiment, the appliance205 terminates the transport control protocol by establishing a firsttransport control protocol connection with the client and a secondtransport control connection with the second appliance or server. Inanother embodiment, the appliance 205 terminates the transport controlprotocol by changing, managing or controlling the behavior of thetransport control protocol connection between the client and the serveror second appliance. For example, the appliance 205 may change, queue,forward or transmit network packets in manner to effectively terminatethe transport control protocol connection or to act or simulate asterminating the connection.

In some embodiments, the second appliance 205 is a performance enhancingproxy. In one embodiment, the appliance 205 provides a virtual privatenetwork (VPN) connection. In some embodiments, the appliance 205provides a Secure Socket Layer VPN (SSL VPN) connection. In otherembodiments, the appliance 205 provides an IPsec (Internet ProtocolSecurity) based VPN connection. In some embodiments, the appliance 205provides any one or more of the following functionality: compression,acceleration, load-balancing, switching/routing, caching, and TransportControl Protocol (TCP) acceleration.

In one embodiment, the appliance 205 is any of the product embodimentsreferred to as Access Gateway, Application Firewall, ApplicationGateway, or NetScaler manufactured by Citrix Systems, Inc. of Ft.Lauderdale, Fla. As such, in some embodiments, the appliance 205includes any logic, functions, rules, or operations to perform servicesor functionality such as SSL VPN connectivity, SSL offloading,switching/load balancing, Domain Name Service resolution, LANacceleration and an application firewall.

In some embodiments, the appliance 205 provides a SSL VPN connectionbetween a client 102 and a server 106. For example, a client 102 on afirst network 104 requests to establish a connection to a server 106 ona second network 104′. In some embodiments, the second network 104″ isnot routable from the first network 104. In other embodiments, theclient 102 is on a public network 104 and the server 106 is on a privatenetwork 104′, such as a corporate network. In one embodiment, a clientagent intercepts communications of the client 102 on the first network104, encrypts the communications, and transmits the communications via afirst transport layer connection to the appliance 205. The appliance 205associates the first transport layer connection on the first network 104to a second transport layer connection to the server 106 on the secondnetwork 104. The appliance 205 receives the intercepted communicationfrom the client agent, decrypts the communications, and transmits thecommunication to the server 106 on the second network 104 via the secondtransport layer connection. The second transport layer connection may bea pooled transport layer connection. In one embodiment, the appliance205 provides an end-to-end secure transport layer connection for theclient 102 between the two networks 104, 104′

In one embodiment, the appliance 205 hosts an intranet internet protocolor intranetIP address of the client 102 on the virtual private network104. The client 102 has a local network identifier, such as an internetprotocol (IP) address and/or host name on the first network 104. Whenconnected to the second network 104′ via the appliance 205, theappliance 205 establishes, assigns or otherwise provides an IntranetIP,which is a network identifier, such as IP address and/or host name, forthe client 102 on the second network 104′. The appliance 205 listens forand receives on the second or private network 104′ for anycommunications directed towards the client 102 using the client'sestablished IntranetIP. In one embodiment, the appliance 205 acts as oron behalf of the client 102 on the second private network 104.

In some embodiment, the appliance 205 has an encryption engine providinglogic, business rules, functions or operations for handling theprocessing of any security related protocol, such as SSL or TLS, or anyfunction related thereto. For example, the encryption engine encryptsand decrypts network packets, or any portion thereof, communicated viathe appliance 205. The encryption engine may also setup or establish SSLor TLS connections on behalf of the client 102 a-102 n, server 106 a-106n, or appliance 200, 205. As such, the encryption engine providesoffloading and acceleration of SSL processing. In one embodiment, theencryption engine uses a tunneling protocol to provide a virtual privatenetwork between a client 102 a-102 n and a server 106 a-106 n. In someembodiments, the encryption engine uses an encryption processor. Inother embodiments, the encryption engine includes executableinstructions running on an encryption processor.

In some embodiments, the appliance 205 provides one or more of thefollowing acceleration techniques to communications between the client102 and server 106: 1) compression, 2) decompression, 3) TransmissionControl Protocol pooling, 4) Transmission Control Protocol multiplexing,5) Transmission Control Protocol buffering, and 6) caching. In oneembodiment, the appliance 200 relieves servers 106 of much of theprocessing load caused by repeatedly opening and closing transportlayers connections to clients 102 by opening one or more transport layerconnections with each server 106 and maintaining these connections toallow repeated data accesses by clients via the Internet. This techniqueis referred to herein as “connection pooling”.

In some embodiments, in order to seamlessly splice communications from aclient 102 to a server 106 via a pooled transport layer connection, theappliance 205 translates or multiplexes communications by modifyingsequence number and acknowledgment numbers at the transport layerprotocol level. This is referred to as “connection multiplexing”. Insome embodiments, no application layer protocol interaction is required.For example, in the case of an in-bound packet (that is, a packetreceived from a client 102), the source network address of the packet ischanged to that of an output port of appliance 205, and the destinationnetwork address is changed to that of the intended server. In the caseof an outbound packet (that is, one received from a server 106), thesource network address is changed from that of the server 106 to that ofan output port of appliance 205 and the destination address is changedfrom that of appliance 205 to that of the requesting client 102. Thesequence numbers and acknowledgment numbers of the packet are alsotranslated to sequence numbers and acknowledgement expected by theclient 102 on the appliance's 205 transport layer connection to theclient 102. In some embodiments, the packet checksum of the transportlayer protocol is recalculated to account for these translations.

In another embodiment, the appliance 205 provides switching orload-balancing functionality for communications between the client 102and server 106. In some embodiments, the appliance 205 distributestraffic and directs client requests to a server 106 based on layer 4payload or application-layer request data. In one embodiment, althoughthe network layer or layer 2 of the network packet identifies adestination server 106, the appliance 205 determines the server 106 todistribute the network packet by application information and datacarried as payload of the transport layer packet. In one embodiment, ahealth monitoring program of the appliance 205 monitors the health ofservers to determine the server 106 for which to distribute a client'srequest. In some embodiments, if the appliance 205 detects a server 106is not available or has a load over a predetermined threshold, theappliance 205 can direct or distribute client requests to another server106.

In some embodiments, the appliance 205 acts as a Domain Name Service(DNS) resolver or otherwise provides resolution of a DNS request fromclients 102. In some embodiments, the appliance intercepts' a DNSrequest transmitted by the client 102. In one embodiment, the appliance205 responds to a client's DNS request with an IP address of or hostedby the appliance 205. In this embodiment, the client 102 transmitsnetwork communication for the domain name to the appliance 200. Inanother embodiment, the appliance 200 responds to a client's DNS requestwith an IP address of or hosted by a second appliance 200′. In someembodiments, the appliance 205 responds to a client's DNS request withan IP address of a server 106 determined by the appliance 200.

In yet another embodiment, the appliance 205 provides applicationfirewall functionality for communications between the client 102 andserver 106. In one embodiment, a policy engine 295′ provides rules fordetecting and blocking illegitimate requests. In some embodiments, theapplication firewall protects against denial of service (DoS) attacks.In other embodiments, the appliance inspects the content of interceptedrequests to identify and block application-based attacks. In someembodiments, the rules/policy engine includes one or more applicationfirewall or security control policies for providing protections againstvarious classes and types of web or Internet based vulnerabilities, suchas one or more of the following: 1) buffer overflow, 2) CGI-BINparameter manipulation, 3) form/hidden field manipulation, 4) forcefulbrowsing, 5) cookie or session poisoning, 6) broken access control list(ACLs) or weak passwords, 7) cross-site scripting (XSS), 8) commandinjection, 9) SQL injection, 10) error triggering sensitive informationleak, 11) insecure use of cryptography, 12) server misconfiguration, 13)back doors and debug options, 14) website defacement, 15) platform oroperating systems vulnerabilities, and 16) zero-day exploits. In anembodiment, the application firewall of the appliance provides HTML formfield protection in the form of inspecting or analyzing the networkcommunication for one or more of the following: 1) required fields arereturned, 2) no added field allowed, 3) read-only and hidden fieldenforcement, 4) drop-down list and radio button field conformance, and5) form-field max-length enforcement. In some embodiments, theapplication firewall of the appliance 205 ensures cookies are notmodified. In other embodiments, the appliance 205 protects againstforceful browsing by enforcing legal URLs.

In still yet other embodiments, the application firewall appliance 205protects any confidential information contained in the networkcommunication. The appliance 205 may inspect or analyze any networkcommunication in accordance with the rules or polices of the policyengine to identify any confidential information in any field of thenetwork packet. In some embodiments, the application firewall identifiesin the network communication one or more occurrences of a credit cardnumber, password, social security number, name, patient code, contactinformation, and age. The encoded portion of the network communicationmay include these occurrences or the confidential information. Based onthese occurrences, in one embodiment, the application firewall may takea policy action on the network communication, such as preventtransmission of the network communication. In another embodiment, theapplication firewall may rewrite, remove or otherwise mask suchidentified occurrence or confidential information.

Although generally referred to as a network optimization or firstappliance 200 and a second appliance 205, the first appliance 200 andsecond appliance 205 may be the same type and form of appliance. In oneembodiment, the second appliance 205 may perform the same functionality,or portion thereof, as the first appliance 200, and vice-versa. Forexample, the first appliance 200 and second appliance 205 may bothprovide acceleration techniques. In one embodiment, the first appliancemay perform LAN acceleration while the second appliance performs WANacceleration, or vice-versa. In another example, the first appliance 200may also be a transport control protocol terminating device as with thesecond appliance 205. Furthermore, although appliances 200 and 205 areshown as separate devices on the network, the appliance 200 and/or 205could be a part of any client 102 or server 106.

Referring now to FIG. 1C, other embodiments of a network environment fordeploying the appliance 200 are depicted. In another embodiment asdepicted on the top of FIG. 1C, the appliance 200 may be deployed as asingle appliance or single proxy on the network 104. For example, theappliance 200 may be designed, constructed or adapted to perform WANoptimization techniques discussed herein without a second cooperatingappliance 200′. In other embodiments as depicted on the bottom of FIG.1C, a single appliance 200 may be deployed with one or more secondappliances 205. For example, a WAN acceleration first appliance 200,such as a Citrix WANScaler appliance, may be deployed with a LANaccelerating or Application Firewall second appliance 205, such as aCitrix NetScaler appliance.

Computing Device

The client 102, server 106, and appliance 200 and 205 may be deployed asand/or executed on any type and form of computing device, such as acomputer, network device or appliance capable of communicating on anytype and form of network and performing the operations described herein.FIGS. 1C and 1D depict block diagrams of a computing device 100 usefulfor practicing an embodiment of the client 102, server 106 or appliance200. As shown in FIGS. 1C and 1D, each computing device 100 includes acentral processing unit 101, and a main memory unit 122. As shown inFIG. 1C, a computing device 100 may include a visual display device 124,a keyboard 126 and/or a pointing device 127, such as a mouse. Eachcomputing device 100 may also include additional optional elements, suchas one or more input/output devices 130 a-130 b (generally referred tousing reference numeral 130), and a cache memory 140 in communicationwith the central processing unit 101.

The central processing unit 101 is any logic circuitry that responds toand processes instructions fetched from the main memory unit 122. Inmany embodiments, the central processing unit is provided by amicroprocessor unit, such as: those manufactured by Intel Corporation ofMountain View, Calif.; those manufactured by Motorola Corporation ofSchaumburg, Ill.; those manufactured by Transmeta Corporation of SantaClara, Calif.; the RS/6000 processor, those manufactured byInternational Business Machines of White Plains, N.Y.; or thosemanufactured by Advanced Micro Devices of Sunnyvale, Calif. Thecomputing device 100 may be based on any of these processors, or anyother processor capable of operating as described herein.

Main memory unit 122 may be one or more memory chips capable of storingdata and allowing any storage location to be directly accessed by themicroprocessor 101, such as Static random access memory (SRAM), BurstSRAM or SynchBurst SRAM (BSRAM), Dynamic random access memory (DRAM),Fast Page Mode DRAM (FPM DRAM), Enhanced DRAM (EDRAM), Extended DataOutput RAM (EDO RAM), Extended Data Output DRAM (EDO DRAM), BurstExtended Data Output DRAM (BEDO DRAM), Enhanced DRAM (EDRAM),synchronous DRAM (SDRAM), JEDEC SRAM, PC100 SDRAM, Double Data RateSDRAM (DDR SDRAM), Enhanced SDRAM (ESDRAM), SyncLink DRAM (SLDRAM),Direct Rambus DRAM (DRDRAM), or Ferroelectric RAM (FRAM). The mainmemory 122 may be based on any of the above described memory chips, orany other available memory chips capable of operating as describedherein. In the embodiment shown in FIG. 1C, the processor 101communicates with main memory 122 via a system bus 150 (described inmore detail below). FIG. 1C depicts an embodiment of a computing device100 in which the processor communicates directly with main memory 122via a memory port 103. For example, in FIG. 1D the main memory 122 maybe DRDRAM.

FIG. 1D depicts an embodiment in which the main processor 101communicates directly with cache memory 140 via a secondary bus,sometimes referred to as a backside bus. In other embodiments, the mainprocessor 101 communicates with cache memory 140 using the system bus150. Cache memory 140 typically has a faster response time than mainmemory 122 and is typically provided by SRAM, BSRAM, or EDRAM. In theembodiment shown in FIG. 1C, the processor 101 communicates with variousI/O devices 130 via a local system bus 150. Various busses may be usedto connect the central processing unit 101 to any of the I/O devices130, including a VESA VL bus, an ISA bus, an EISA bus, a MicroChannelArchitecture (MCA) bus, a PCI bus, a PCI-X bus, a PCI-Express bus, or aNuBus. For embodiments in which the I/O device is a video display 124,the processor 101 may use an Advanced Graphics Port (AGP) to communicatewith the display 124. FIG. 1D depicts an embodiment of a computer 100 inwhich the main processor 101 communicates directly with I/O device 130via HyperTransport, Rapid I/O, or InfiniBand. FIG. 1D also depicts anembodiment in which local busses and direct communication are mixed: theprocessor 101 communicates with I/O device 130 using a localinterconnect bus while communicating with I/O device 130 directly.

The computing device 100 may support any suitable installation device116, such as a floppy disk drive for receiving floppy disks such as3.5-inch, 5.25-inch disks or ZIP disks, a CD-ROM drive, a CD-R/RW drive,a DVD-ROM drive, tape drives of various formats, USB device, hard-driveor any other device suitable for installing software and programs suchas any client agent 120, or portion thereof. The computing device 100may further comprise a storage device 128, such as one or more hard diskdrives or redundant arrays of independent disks, for storing anoperating system and other related software, and for storing applicationsoftware programs such as any program related to the client agent 120.Optionally, any of the installation devices 116 could also be used asthe storage device 128. Additionally, the operating system and thesoftware can be run from a bootable medium, for example, a bootable CD,such as KNOPPIX®, a bootable CD for GNU/Linux that is available as aGNU/Linux distribution from knoppix.net.

Furthermore, the computing device 100 may include a network interface118 to interface to a Local Area Network (LAN), Wide Area Network (WAN)or the Internet through a variety of connections including, but notlimited to, standard telephone lines, LAN or WAN links (e.g., 802.11,T1, T3, 56 kb, X.25), broadband connections (e.g., ISDN, Frame Relay,ATM), wireless connections, or some combination of any or all of theabove. The network interface 118 may comprise a built-in networkadapter, network interface card, PCMCIA network card, card bus networkadapter, wireless network adapter, USB network adapter, modem or anyother device suitable for interfacing the computing device 100 to anytype of network capable of communication and performing the operationsdescribed herein. A wide variety of I/O devices 130 a-130 n may bepresent in the computing device 100. Input devices include keyboards,mice, trackpads, trackballs, microphones, and drawing tablets. Outputdevices include video displays, speakers, inkjet printers, laserprinters, and dye-sublimation printers. The I/O devices 130 may becontrolled by an I/O controller 123 as shown in FIG. 1C. The I/Ocontroller may control one or more I/O devices such as a keyboard 126and a pointing device 127, e.g., a mouse or optical pen. Furthermore, anI/O device may also provide storage 128 and/or an installation medium116 for the computing device 100. In still other embodiments, thecomputing device 100 may provide USB connections to receive handheld USBstorage devices such as the USB Flash Drive line of devices manufacturedby Twintech Industry, Inc. of Los Alamitos, Calif.

In some embodiments, the computing device 100 may comprise or beconnected to multiple display devices 124 a-124 n, which each may be ofthe same or different type and/or form. As such, any of the I/O devices130 a-130 n and/or the I/O controller 123 may comprise any type and/orform of suitable hardware, software, or combination of hardware andsoftware to support, enable or provide for the connection and use ofmultiple display devices 124 a-124 n by the computing device 100. Forexample, the computing device 100 may include any type and/or form ofvideo adapter, video card, driver, and/or library to interface,communicate, connect or otherwise use the display devices 124 a-124 n.In one embodiment, a video adapter may comprise multiple connectors tointerface to multiple display devices 124 a-124 n. In other embodiments,the computing device 100 may include multiple video adapters, with eachvideo adapter connected to one or more of the display devices 124 a-124n. In some embodiments, any portion of the operating system of thecomputing device 100 may be configured for using multiple displays 124a-124 n. In other embodiments, one or more of the display devices 124a-124 n may be provided by one or more other computing devices, such ascomputing devices 100 a and 100 b connected to the computing device 100,for example, via a network. These embodiments may include any type ofsoftware designed and constructed to use another computer's displaydevice as a second display device 124 a for the computing device 100.One ordinarily skilled in the art will recognize and appreciate thevarious ways and embodiments that a computing device 100 may beconfigured to have multiple display devices 124 a-124 n.

In further embodiments, an I/O device 130 may be a bridge 170 betweenthe system bus 150 and an external communication bus, such as a USB bus,an Apple Desktop Bus, an RS-232 serial connection, a SCSI bus, aFireWire bus, a FireWire 800 bus, an Ethernet bus, an AppleTalk bus, aGigabit Ethernet bus, an Asynchronous Transfer Mode bus, a HIPPI bus, aSuper HIPPI bus, a SerialPlus bus, a SCI/LAMP bus, a FibreChannel bus,or a Serial Attached small computer system interface bus.

A computing device 100 of the sort depicted in FIGS. 1C and 1D typicallyoperate under the control of operating systems, which control schedulingof tasks and access to system resources. The computing device 100 can berunning any operating system such as any of the versions of theMicrosoft® Windows operating systems, the different releases of the Unixand Linux operating systems, any version of the Mac OS® or OS X forMacintosh computers, any embedded operating system, any real-timeoperating system, any open source operating system, any proprietaryoperating system, any operating systems for mobile computing devices, orany other operating system capable of running on the computing deviceand performing the operations described herein. Typical operatingsystems include: WINDOWS 3.x, WINDOWS 95, WINDOWS 98, WINDOWS 2000,WINDOWS NT 3.51, WINDOWS NT 4.0, WINDOWS CE, WINDOWS 2003, WINDOWS XP,and WINDOWS VISTA all of which are manufactured by Microsoft Corporationof Redmond, Wash.; MacOS and OS X, manufactured by Apple Computer ofCupertino, Calif.; OS/2, manufactured by International Business Machinesof Armonk, N.Y.; and Linux, a freely-available operating systemdistributed by Caldera Corp. of Salt Lake City, Utah, or any type and/orform of a Unix operating system, (such as those versions of Unixreferred to as Solaris/Sparc, Solaris/x86, AIX IBM, HP UX, and SGI(Silicon Graphics)), among others.

In other embodiments, the computing device 100 may have differentprocessors, operating systems, and input devices consistent with thedevice. For example, in one embodiment the computer 100 is a Treo 180,270, 1060, 600 or 650 smart phone manufactured by Palm, Inc. In thisembodiment, the Treo smart phone is operated under the control of thePalmOS operating system and includes a stylus input device as well as afive-way navigator device. In another example, the computing device 100may be a WinCE or PocketPC device with an ARM (Advanced RISC Machine)type of processor. In one example, the computing device 100 includes aSeries 80 (Nokia 9500 or Nokia 9300) type of smart phone manufactured byNokia of Finland, which may run the Symbian OS or EPOC mobile operatingsystem manufactured by Symbian Software Limited of London, UnitedKingdom. In another example, the computing device 100 may include a FOMAM100 brand smart phone manufactured by Motorola, Inc. of Schaumburg,Ill., and operating the EPOC or Symbian OS operating system. In yetanother example, the computing device 100 includes a Sony Ericsson P800,P900 or P910 Alpha model phone manufactured by Sony Ericsson MobileCommunications (USA) Inc. of Research Triangle Park, North Carolina.Moreover, the computing device 100 can be any workstation, desktopcomputer, laptop or notebook computer, server, handheld computer, mobiletelephone, smart phone, any other computer, or other form of computingor telecommunications device that is capable of communication and thathas sufficient processor power and memory capacity to perform theoperations described herein.

B. System and Appliance Architecture

Referring now to FIG. 2A, an embodiment of a system environment andarchitecture of an appliance 200 for delivering and/or operating acomputing environment on a client is depicted. In some embodiments, aserver 106 includes an application delivery system 290 for delivering acomputing environment or an application and/or data file to one or moreclients 102. In brief overview, a client 102 is in communication with aserver 106 via network 104 and appliance 200. For example, the client102 may reside in a remote office of a company, e.g., a branch office,and the server 106 may reside at a corporate data center. The client 102has a client agent 120, and a computing environment 215. The computingenvironment 215 may execute or operate an application that accesses,processes or uses a data file. The computing environment 215,application and/or data file may be delivered via the appliance 200and/or the server 106.

In some embodiments, the appliance 200 accelerates delivery of acomputing environment 215, or any portion thereof, to a client 102. Inone embodiment, the appliance 200 accelerates the delivery of thecomputing environment 215 by the application delivery system 290. Forexample, the embodiments described herein may be used to acceleratedelivery of a streaming application and data file processable by theapplication from a central corporate data center to a remote userlocation, such as a branch office of the company. In another embodiment,the appliance 200 accelerates transport layer traffic between a client102 and a server 106. In another embodiment, the appliance 200 controls,manages, or adjusts the transport layer protocol to accelerate deliveryof the computing environment. In some embodiments, the appliance 200uses caching and/or compression techniques to accelerate delivery of acomputing environment.

In some embodiments, the application delivery management system 290provides application delivery techniques to deliver a computingenvironment to a desktop of a user, remote or otherwise, based on aplurality of execution methods and based on any authentication andauthorization policies applied via a policy engine 295. With thesetechniques, a remote user may obtain a computing environment and accessto server stored applications and data files from any network connecteddevice 100. In one embodiment, the application delivery system 290 mayreside or execute on a server 106. In another embodiment, theapplication delivery system 290 may reside or execute on a plurality ofservers 106 a-106 n. In some embodiments, the application deliverysystem 290 may execute in a server farm 38. In one embodiment, theserver 106 executing the application delivery system 290 may also storeor provide the application and data file. In another embodiment, a firstset of one or more servers 106 may execute the application deliverysystem 290, and a different server 106 n may store or provide theapplication and data file. In some embodiments, each of the applicationdelivery system 290, the application, and data file may reside or belocated on different servers. In yet another embodiment, any portion ofthe application delivery system 290 may reside, execute or be stored onor distributed to the appliance 200, or a plurality of appliances.

The client 102 may include a computing environment 215 for executing anapplication that uses or processes a data file. The client 102 vianetworks 104, 104′ and appliance 200 may request an application and datafile from the server 106. In one embodiment, the appliance 200 mayforward a request from the client 102 to the server 106. For example,the client 102 may not have the application and data file stored oraccessible locally. In response to the request, the application deliverysystem 290 and/or server 106 may deliver the application and data fileto the client 102. For example, in one embodiment, the server 106 maytransmit the application as an application stream to operate incomputing environment 215 on client 102.

In some embodiments, the application delivery system 290 comprises anyportion of the Citrix Access Suite™ by Citrix Systems, Inc., such as theMetaFrame or Citrix Presentation Server™ and/or any of the Microsoft®Windows Terminal Services manufactured by the Microsoft Corporation. Inone embodiment, the application delivery system 290 may deliver one ormore applications to clients 102 or users via a remote-display protocolor otherwise via remote-based or server-based computing. In anotherembodiment, the application delivery system 290 may deliver one or moreapplications to clients or users via steaming of the application.

In one embodiment, the application delivery system 290 includes a policyengine 295 for controlling and managing the access to applications,selection of application execution methods and the delivery ofapplications. In some embodiments, the policy engine 295 determines theone or more applications a user or client 102 may access. In anotherembodiment, the policy engine 295 determines how the application shouldbe delivered to the user or client 102, e.g., the method of execution.In some embodiments, the application delivery system 290 provides aplurality of delivery techniques from which to select a method ofapplication execution, such as a server-based computing, streaming ordelivering the application locally to the client 120 for localexecution.

In one embodiment, a client 102 requests execution of an applicationprogram and the application delivery system 290 comprising a server 106selects a method of executing the application program. In someembodiments, the server 106 receives credentials from the client 102. Inanother embodiment, the server 106 receives a request for an enumerationof available applications from the client 102. In one embodiment, inresponse to the request or receipt of credentials, the applicationdelivery system 290 enumerates a plurality of application programsavailable to the client 102. The application delivery system 290receives a request to execute an enumerated application. The applicationdelivery system 290 selects one of a predetermined number of methods forexecuting the enumerated application, for example, responsive to apolicy of a policy engine. The application delivery system 290 mayselect a method of execution of the application enabling the client 102to receive application-output data generated by execution of theapplication program on a server 106. The application delivery system 290may select a method of execution of the application enabling the clientor local machine 102 to execute the application program locally afterretrieving a plurality of application files comprising the application.In yet another embodiment, the application delivery system 290 mayselect a method of execution of the application to stream theapplication via the network 104 to the client 102.

A client 102 may execute, operate or otherwise provide an application,which can be any type and/or form of software, program, or executableinstructions such as any type and/or form of web browser, web-basedclient, client-server application, a thin-client computing client, anActiveX control, or a Java applet, or any other type and/or form ofexecutable instructions capable of executing on client 102. In someembodiments, the application may be a server-based or a remote-basedapplication executed on behalf of the client 102 on a server 106. In oneembodiment the server 106 may display output to the client 102 using anythin-client or remote-display protocol, such as the IndependentComputing Architecture (ICA) protocol manufactured by Citrix Systems,Inc. of Ft. Lauderdale, Fla. or the Remote Desktop Protocol (RDP)manufactured by the Microsoft Corporation of Redmond, Wash. Theapplication can use any type of protocol and it can be, for example, anHTTP client, an FTP client, an Oscar client, or a Telnet client. Inother embodiments, the application comprises any type of softwarerelated to VoIP communications, such as a soft IP telephone. In furtherembodiments, the application comprises any application related toreal-time data communications, such as applications for streaming videoand/or audio.

In some embodiments, the server 106 or a server farm 38 may be runningone or more applications, such as an application providing a thin-clientcomputing or remote display presentation application. In one embodiment,the server 106 or server farm 38 executes, as an application, anyportion of the Citrix Access Suite™ by Citrix Systems, Inc., such as theMetaFrame or Citrix Presentation Server™, and/or any of the Microsoft®Windows Terminal Services manufactured by the Microsoft Corporation. Inone embodiment, the application is an ICA client, developed by CitrixSystems, Inc. of Fort Lauderdale, Fla. In other embodiments, theapplication includes a Remote Desktop (RDP) client, developed byMicrosoft Corporation of Redmond, Wash. Also, the server 106 may run anapplication, which for example, may be an application server providingemail services such as Microsoft Exchange manufactured by the MicrosoftCorporation of Redmond, Wash., a web or Internet server, or a desktopsharing server, or a collaboration server. In some embodiments, any ofthe applications may comprise any type of hosted service or products,such as GoToMeeting™ provided by Citrix Online Division, Inc. of SantaBarbara, Calif., WebEX™ provided by WebEx, Inc. of Santa Clara, Calif.,or Microsoft Office Live Meeting provided by Microsoft Corporation ofRedmond, Wash.

Example Appliance Architecture

FIG. 2A also illustrates an example embodiment of the appliance 200. Thearchitecture of the appliance 200 in FIG. 2A is provided by way ofillustration only and is not intended to be limiting in any manner. Theappliance 200 may include any type and form of computing device 100,such as any element or portion described in conjunction with FIGS. 1Dand 1E above. In brief overview, the appliance 200 has one or morenetwork ports 266A-226N and one or more networks stacks 267A-267N forreceiving and/or transmitting communications via networks 104. Theappliance 200 also has a network optimization engine 250 for optimizing,accelerating or otherwise improving the performance, operation, orquality of any network traffic or communications traversing theappliance 200.

The appliance 200 includes or is under the control of an operatingsystem. The operating system of the appliance 200 may be any type and/orform of Unix operating system although the invention is not so limited.As such, the appliance 200 can be running any operating system such asany of the versions of the Microsoft® Windows operating systems, thedifferent releases of the Unix and Linux operating systems, any versionof the Mac OS® for Macintosh computers, any embedded operating system,any network operating system, any real-time operating system, any opensource operating system, any proprietary operating system, any operatingsystems for mobile computing devices or network devices, or any otheroperating system capable of running on the appliance 200 and performingthe operations described herein.

The operating system of appliance 200 allocates, manages, or otherwisesegregates the available system memory into what is referred to askernel or system space, and user or application space. The kernel spaceis typically reserved for running the kernel, including any devicedrivers, kernel extensions or other kernel related software. As known tothose skilled in the art, the kernel is the core of the operatingsystem, and provides access, control, and management of resources andhardware-related elements of the appliance 200. In accordance with anembodiment of the appliance 200, the kernel space also includes a numberof network services or processes working in conjunction with the networkoptimization engine 250, or any portion thereof. Additionally, theembodiment of the kernel will depend on the embodiment of the operatingsystem installed, configured, or otherwise used by the device 200. Incontrast to kernel space, user space is the memory area or portion ofthe operating system used by user mode applications or programsotherwise running in user mode. A user mode application may not accesskernel space directly and uses service calls in order to access kernelservices. The operating system uses the user or application space forexecuting or running applications and provisioning of user levelprograms, services, processes and/or tasks.

The appliance 200 has one or more network ports 266 for transmitting andreceiving data over a network 104. The network port 266 provides aphysical and/or logical interface between the computing device and anetwork 104 or another device 100 for transmitting and receiving networkcommunications. The type and form of network port 266 depends on thetype and form of network and type of medium for connecting to thenetwork. Furthermore, any software of, provisioned for or used by thenetwork port 266 and network stack 267 may run in either kernel space oruser space.

In one embodiment, the appliance 200 has one network stack 267, such asa TCP/IP based stack, for communicating on a network 105, such with theclient 102 and/or the server 106. In one embodiment, the network stack267 is used to communicate with a first network, such as network 104,and also with a second network 104′. In another embodiment, theappliance 200 has two or more network stacks, such as first networkstack 267A and a second network stack 267N. The first network stack 267Amay be used in conjunction with a first port 266A to communicate on afirst network 104. The second network stack 267N may be used inconjunction with a second port 266N to communicate on a second network104′. In one embodiment, the network stack(s) 267 has one or morebuffers for queuing one or more network packets for transmission by theappliance 200.

The network stack 267 includes any type and form of software, orhardware, or any combinations thereof, for providing connectivity to andcommunications with a network. In one embodiment, the network stack 267includes a software implementation for a network protocol suite. Thenetwork stack 267 may have one or more network layers, such as anynetworks layers of the Open Systems Interconnection (OSI) communicationsmodel as those skilled in the art recognize and appreciate. As such, thenetwork stack 267 may have any type and form of protocols for any of thefollowing layers of the OSI model: 1) physical link layer, 2) data linklayer, 3) network layer, 4) transport layer, 5) session layer, 6)presentation layer, and 7) application layer. In one embodiment, thenetwork stack 267 includes a transport control protocol (TCP) over thenetwork layer protocol of the internet protocol (IP), generally referredto as TCP/IP. In some embodiments, the TCP/IP protocol may be carriedover the Ethernet protocol, which may comprise any of the family of IEEEwide-area-network (WAN) or local-area-network (LAN) protocols, such asthose protocols covered by the IEEE 802.3. In some embodiments, thenetwork stack 267 has any type and form of a wireless protocol, such asIEEE 802.11 and/or mobile internet protocol.

In view of a TCP/IP based network, any TCP/IP based protocol may beused, including Messaging Application Programming Interface (MAPI)(email), File Transfer Protocol (FTP), HyperText Transfer Protocol(HTTP), Common Internet File System (CIFS) protocol (file transfer),Independent Computing Architecture (ICA) protocol, Remote DesktopProtocol (RDP), Wireless Application Protocol (WAP), Mobile IP protocol,and Voice Over IP (VoIP) protocol. In another embodiment, the networkstack 267 comprises any type and form of transport control protocol,such as a modified transport control protocol, for example a TransactionTCP (T/TCP), TCP with selection acknowledgements (TCP-SACK), TCP withlarge windows (TCP-LW), a congestion prediction protocol such as theTCP-Vegas protocol, and a TCP spoofing protocol. In other embodiments,any type and form of user datagram protocol (UDP), such as UDP over IP,may be used by the network stack 267, such as for voice communicationsor real-time data communications.

Furthermore, the network stack 267 may include one or more networkdrivers supporting the one or more layers, such as a TCP driver or anetwork layer driver. The network drivers may be included as part of theoperating system of the computing device 100 or as part of any networkinterface cards or other network access components of the computingdevice 100. In some embodiments, any of the network drivers of thenetwork stack 267 may be customized, modified or adapted to provide acustom or modified portion of the network stack 267 in support of any ofthe techniques described herein.

In one embodiment, the appliance 200 provides for or maintains atransport layer connection between a client 102 and server 106 using asingle network stack 267. In some embodiments, the appliance 200effectively terminates the transport layer connection by changing,managing or controlling the behavior of the transport control protocolconnection between the client and the server. In these embodiments, theappliance 200 may use a single network stack 267. In other embodiments,the appliance 200 terminates a first transport layer connection, such asa TCP connection of a client 102, and establishes a second transportlayer connection to a server 106 for use by or on behalf of the client102, e.g., the second transport layer connection is terminated at theappliance 200 and the server 106. The first and second transport layerconnections may be established via a single network stack 267. In otherembodiments, the appliance 200 may use multiple network stacks, forexample 267A and 267N. In these embodiments, the first transport layerconnection may be established or terminated at one network stack 267A,and the second transport layer connection may be established orterminated on the second network stack 267N. For example, one networkstack may be for receiving and transmitting network packets on a firstnetwork, and another network stack for receiving and transmittingnetwork packets on a second network.

As shown in FIG. 2A, the network optimization engine 250 includes one ormore of the following elements, components or modules: network packetprocessing engine 240, LAN/WAN detector 210, flow controller 220, QoSengine 236, protocol accelerator 234, compression engine 238, cachemanager 232 and policy engine 295′. The network optimization engine 250,or any portion thereof, may include software, hardware or anycombination of software and hardware. Furthermore, any software of,provisioned for or used by the network optimization engine 250 may runin either kernel space or user space. For example, in one embodiment,the network optimization engine 250 may run in kernel space. In anotherembodiment, the network optimization engine 250 may run in user space.In yet another embodiment, a first portion of the network optimizationengine 250 runs in kernel space while a second portion of the networkoptimization engine 250 runs in user space.

Network Packet Processing Engine

The network packet engine 240, also generally referred to as a packetprocessing engine or packet engine, is responsible for controlling andmanaging the processing of packets received and transmitted by appliance200 via network ports 266 and network stack(s) 267. The network packetengine 240 may operate at any layer of the network stack 267. In oneembodiment, the network packet engine 240 operates at layer 2 or layer 3of the network stack 267. In some embodiments, the packet engine 240intercepts or otherwise receives packets at the network layer, such asthe IP layer in a TCP/IP embodiment. In another embodiment, the packetengine 240 operates at layer 4 of the network stack 267. For example, insome embodiments, the packet engine 240 intercepts or otherwise receivespackets at the transport layer, such as intercepting packets as the TCPlayer in a TCP/IP embodiment. In other embodiments, the packet engine240 operates at any session or application layer above layer 4. Forexample, in one embodiment, the packet engine 240 intercepts orotherwise receives network packets above the transport layer protocollayer, such as the payload of a TCP packet in a TCP embodiment.

The packet engine 240 may include a buffer for queuing one or morenetwork packets during processing, such as for receipt of a networkpacket or transmission of a network packet. Additionally, the packetengine 240 is in communication with one or more network stacks 267 tosend and receive network packets via network ports 266. The packetengine 240 may include a packet processing timer. In one embodiment, thepacket processing timer provides one or more time intervals to triggerthe processing of incoming, i.e., received, or outgoing, i.e.,transmitted, network packets. In some embodiments, the packet engine 240processes network packets responsive to the timer. The packet processingtimer provides any type and form of signal to the packet engine 240 tonotify, trigger, or communicate a time related event, interval oroccurrence. In many embodiments, the packet processing timer operates inthe order of milliseconds, such as for example 100 ms, 50 ms, 25 ms, 10ms, 5 ms or 1 ms.

During operations, the packet engine 240 may be interfaced, integratedor be in communication with any portion of the network optimizationengine 250, such as the LAN/WAN detector 210, flow controller 220, QoSengine 236, protocol accelerator 234, compression engine 238, cachemanager 232 and/or policy engine 295′. As such, any of the logic,functions, or operations of the LAN/WAN detector 210, flow controller220, QoS engine 236, protocol accelerator 234, compression engine 238,cache manager 232 and policy engine 295′ may be performed responsive tothe packet processing timer and/or the packet engine 240. In someembodiments, any of the logic, functions, or operations of theencryption engine 234, cache manager 232, policy engine 236 andmulti-protocol compression logic 238 may be performed at the granularityof time intervals provided via the packet processing timer, for example,at a time interval of less than or equal to 10 ms. For example, in oneembodiment, the cache manager 232 may perform expiration of any cachedobjects responsive to the integrated packet engine 240 and/or the packetprocessing timer 242. In another embodiment, the expiry or invalidationtime of a cached object can be set to the same order of granularity asthe time interval of the packet processing timer, such as at every 10ms.

Cache Manager

The cache manager 232 may include software, hardware or any combinationof software and hardware to store data, information and objects to acache in memory or storage, provide cache access, and control and managethe cache. The data, objects or content processed and stored by thecache manager 232 may include data in any format, such as a markuplanguage, or any type of data communicated via any protocol. In someembodiments, the cache manager 232 duplicates original data storedelsewhere or data previously computed, generated or transmitted, inwhich the original data may require longer access time to fetch, computeor otherwise obtain relative to reading a cache memory or storageelement. Once the data is stored in the cache, future use can be made byaccessing the cached copy rather than refetching or recomputing theoriginal data, thereby reducing the access time. In some embodiments,the cache may comprise a data object in memory of the appliance 200. Inanother embodiment, the cache may comprise any type and form of storageelement of the appliance 200, such as a portion of a hard disk. In someembodiments, the processing unit of the device may provide cache memoryfor use by the cache manager 232. In yet further embodiments, the cachemanager 232 may use any portion and combination of memory, storage, orthe processing unit for caching data, objects, and other content.

Furthermore, the cache manager 232 includes any logic, functions, rules,or operations to perform any caching techniques of the appliance 200. Insome embodiments, the cache manager 232 may operate as an application,library, program, service, process, thread or task. In some embodiments,the cache manager 232 can comprise any type of general purpose processor(GPP), or any other type of integrated circuit, such as a FieldProgrammable Gate Array (FPGA), Programmable Logic Device (PLD), orApplication Specific Integrated Circuit (ASIC).

Policy Engine

The policy engine 295′ includes any logic, function or operations forproviding and applying one or more policies or rules to the function,operation or configuration of any portion of the appliance 200. Thepolicy engine 295′ may include, for example, an intelligent statisticalengine or other programmable application(s). In one embodiment, thepolicy engine 295 provides a configuration mechanism to allow a user toidentify, specify, define or configure a policy for the networkoptimization engine 250, or any portion thereof. For example, the policyengine 295 may provide policies for what data to cache, when to cachethe data, for whom to cache the data, when to expire an object in cacheor refresh the cache. In other embodiments, the policy engine 236 mayinclude any logic, rules, functions or operations to determine andprovide access, control and management of objects, data or content beingcached by the appliance 200 in addition to access, control andmanagement of security, network traffic, network access, compression orany other function or operation performed by the appliance 200.

In some embodiments, the policy engine 295′ provides and applies one ormore policies based on any one or more of the following: a user,identification of the client, identification of the server, the type ofconnection, the time of the connection, the type of network, or thecontents of the network traffic. In one embodiment, the policy engine295′ provides and applies a policy based on any field or header at anyprotocol layer of a network packet. In another embodiment, the policyengine 295′ provides and applies a policy based on any payload of anetwork packet. For example, in one embodiment, the policy engine 295′applies a policy based on identifying a certain portion of content of anapplication layer protocol carried as a payload of a transport layerpacket. In another example, the policy engine 295′ applies a policybased on any information identified by a client, server or usercertificate. In yet another embodiment, the policy engine 295′ applies apolicy based on any attributes or characteristics obtained about aclient 102, such as via any type and form of endpoint detection (see forexample the collection agent of the client agent discussed below).

In one embodiment, the policy engine 295′ works in conjunction orcooperation with the policy engine 295 of the application deliverysystem 290. In some embodiments, the policy engine 295′ is a distributedportion of the policy engine 295 of the application delivery system 290.In another embodiment, the policy engine 295 of the application deliverysystem 290 is deployed on or executed on the appliance 200. In someembodiments, the policy engines 295, 295′ both operate on the appliance200. In yet another embodiment, the policy engine 295′, or a portionthereof, of the appliance 200 operates on a server 106.

Multi-Protocol and Multi-Layer Compression Engine

The compression engine 238 includes any logic, business rules, functionor operations for compressing one or more protocols of a network packet,such as any of the protocols used by the network stack 267 of theappliance 200. The compression engine 238 may also be referred to as amulti-protocol compression engine 238 in that it may be designed,constructed or capable of compressing a plurality of protocols. In oneembodiment, the compression engine 238 applies context insensitivecompression, which is compression applied to data without knowledge ofthe type of data. In another embodiment, the compression engine 238applies context-sensitive compression. In this embodiment, thecompression engine 238 utilizes knowledge of the data type to select aspecific compression algorithm from a suite of suitable algorithms. Insome embodiments, knowledge of the specific protocol is used to performcontext-sensitive compression. In one embodiment, the appliance 200 orcompression engine 238 can use port numbers (e.g., well-known ports), aswell as data from the connection itself to determine the appropriatecompression algorithm to use. Some protocols use only a single type ofdata, requiring only a single compression algorithm that can be selectedwhen the connection is established. Other protocols contain differenttypes of data at different times. For example, POP, IMAP, SMTP, and HTTPall move files of arbitrary types interspersed with other protocol data.

In one embodiment, the compression engine 238 uses a delta-typecompression algorithm. In another embodiment, the compression engine 238uses first site compression as well as searching for repeated patternsamong data stored in cache, memory or disk. In some embodiments, thecompression engine 238 uses a lossless compression algorithm. In otherembodiments, the compression engine uses a lossy compression algorithm.In some cases, knowledge of the data type and, sometimes, permissionfrom the user are required to use a lossy compression algorithm. In someembodiments, compression is not limited to the protocol payload. Thecontrol fields of the protocol itself may be compressed. In someembodiments, the compression engine 238 uses a different algorithm forcontrol fields than that used for the payload.

In some embodiments, the compression engine 238 compresses at one ormore layers of the network stack 267. In one embodiment, the compressionengine 238 compresses at a transport layer protocol. In anotherembodiment, the compression engine 238 compresses at an applicationlayer protocol. In some embodiments, the compression engine 238compresses at a layer 2-4 protocol. In other embodiments, thecompression engine 238 compresses at a layer 5-7 protocol. In yetanother embodiment, the compression engine compresses a transport layerprotocol and an application layer protocol. In some embodiments, thecompression engine 238 compresses a layer 2-4 protocol and a layer 5-7protocol.

In some embodiments, the compression engine 238 uses memory-basedcompression, cache-based compression or disk-based compression or anycombination thereof. As such, the compression engine 238 may be referredto as a multi-layer compression engine. In one embodiment, thecompression engine 238 uses a history of data stored in memory, such asRAM. In another embodiment, the compression engine 238 uses a history ofdata stored in a cache, such as L2 cache of the processor. In otherembodiments, the compression engine 238 uses a history of data stored toa disk or storage location. In some embodiments, the compression engine238 uses a hierarchy of cache-based, memory-based and disk-based datahistory. The compression engine 238 may first use the cache-based datato determine one or more data matches for compression, and then maycheck the memory-based data to determine one or more data matches forcompression. In another case, the compression engine 238 may check diskstorage for data matches for compression after checking either thecache-based and/or memory-based data history.

In one embodiment, multi-protocol compression engine 238 compressesbi-directionally between clients 102 a-102 n and servers 106 a-106 n anyTCP/IP based protocol, including Messaging Application ProgrammingInterface (MAPI) (email), File Transfer Protocol (FTP), HyperTextTransfer Protocol (HTTP), Common Internet File System (CIFS) protocol(file transfer), Independent Computing Architecture (ICA) protocol,Remote Desktop Protocol (RDP), Wireless Application Protocol (WAP),Mobile IP protocol, and Voice Over IP (VoIP) protocol. In otherembodiments, multi-protocol compression engine 238 provides compressionof HyperText Markup Language (HTML) based protocols and in someembodiments, provides compression of any markup languages, such as theExtensible Markup Language (XML). In one embodiment, the multi-protocolcompression engine 238 provides compression of any high-performanceprotocol, such as any protocol designed for appliance 200 to appliance200 communications. In another embodiment, the multi-protocolcompression engine 238 compresses any payload of or any communicationusing a modified transport control protocol, such as Transaction TCP(T/TCP), TCP with selection acknowledgements (TCP-SACK), TCP with largewindows (TCP-LW), a congestion prediction protocol such as the TCP-Vegasprotocol, and a TCP spoofing protocol.

As such, the multi-protocol compression engine 238 may accelerateperformance for users accessing applications via desktop clients, e.g.,Microsoft Outlook and non-Web thin clients, such as any client launchedby popular enterprise applications like Oracle, SAP and Siebel, and evenmobile clients, such as the Pocket PC. In some embodiments, themulti-protocol compression engine by integrating with packet processingengine 240 accessing the network stack 267 is able to compress any ofthe protocols carried by a transport layer protocol, such as anyapplication layer protocol.

LAN/WAN Detector

The LAN/WAN detector 238 includes any logic, business rules, function oroperations for automatically detecting a slow side connection (e.g., awide area network (WAN) connection such as an Intranet) and associatedport 267, and a fast side connection (e.g., a local area network (LAN)connection) and an associated port 267. In some embodiments, the LAN/WANdetector 238 monitors network traffic on the network ports 267 of theappliance 200 to detect a synchronization packet, sometimes referred toas a “tagged” network packet. The synchronization packet identifies atype or speed of the network traffic. In one embodiment, thesynchronization packet identifies a WAN speed or WAN type connection.The LAN/WAN detector 238 also identifies receipt of an acknowledgementpacket to a tagged synchronization packet and on which port it isreceived. The appliance 200 then configures itself to operate theidentified port on which the tagged synchronization packet arrived sothat the speed on that port is set to be the speed associated with thenetwork connected to that port. The other port is then set to the speedassociated with the network connected to that port.

For ease of discussion herein, reference to “slow” side will be madewith respect to connection with a wide area network (WAN), e.g., theInternet, and operating at a network speed of the WAN. Likewise,reference to “fast” side will be made with respect to connection with alocal area network (LAN) and operating at a network speed the LAN.However, it is noted that “fast” and “slow” sides in a network canchange on a per-connection basis and are relative terms to the speed ofthe network connections or to the type of network topology. Suchconfigurations are useful in complex network topologies, where a networkis “fast” or “slow” only when compared to adjacent networks and not inany absolute sense.

In one embodiment, the LAN/WAN detector 238 may be used to allow forauto-discovery by an appliance 200 of a network to which it connects. Inanother embodiment, the LAN/WAN detector 238 may be used to detect theexistence or presence of a second appliance 200′ deployed in the network104. For example, an auto-discovery mechanism in operation in accordancewith FIG. 1A functions as follows: appliance 200 and 200′ are placed inline with the connection linking client 102 and server 106. Theappliances 200 and 200′ are at the ends of a low-speed link, e.g.,Internet, connecting two LANs. In one example embodiment, appliances 200and 200′ each include two ports—one to connect with the “lower” speedlink and the other to connect with a “higher” speed link, e.g., a LAN.Any packet arriving at one port is copied to the other port. Thus,appliance 200 and 200′ are each configured to function as a bridgebetween the two networks 104.

When an end node, such as the client 102, opens a new TCP connectionwith another end node, such as the server 106, the client 102 sends aTCP packet with a synchronization (SYN) header bit set, or a SYN packet,to the server 106. In the present example, client 102 opens a transportlayer connection to server 106. When the SYN packet passes throughappliance 200, the appliance 200 inserts, attaches or otherwise providesa characteristic TCP header option to the packet, which announces itspresence. If the packet passes through a second appliance, in thisexample appliance 200′ the second appliance notes the header option onthe SYN packet. The server 106 responds to the SYN packet with asynchronization acknowledgment (SYN-ACK) packet. When the SYN-ACK packetpasses through appliance 200′, a TCP header option is tagged (e.g.,attached, inserted or added) to the SYN-ACK packet to announce appliance200′ presence to appliance 200. When appliance 200 receives this packet,both appliances 200, 200′ are now aware of each other and the connectioncan be appropriately accelerated.

Further to the operations of the LAN/WAN detector 238, a method orprocess for detecting “fast” and “slow” sides of a network using a SYNpacket is described. During a transport layer connection establishmentbetween a client 102 and a server 106, the appliance 200 via the LAN/WANdetector 238 determines whether the SYN packet is tagged with anacknowledgement (ACK). If it is tagged, the appliance 200 identifies orconfigures the port receiving the tagged SYN packet (SYN-ACK) as the“slow” side. In one embodiment, the appliance 200 optionally removes theACK tag from the packet before copying the packet to the other port. Ifthe LAN/WAN detector 238 determines that the packet is not tagged, theappliance 200 identifies or configure the port receiving the untaggedpacket as the “fast” side. The appliance 200 then tags the SYN packetwith an ACK and copies the packet to the other port.

In another embodiment, the LAN/WAN detector 238 detects fast and slowsides of a network using a SYN-ACK packet. The appliance 200 via theLAN/WAN detector 238 determines whether the SYN-ACK packet is taggedwith an acknowledgement (ACK). If it is tagged, the appliance 200identifies or configures the port receiving the tagged SYN packet(SYN-ACK) as the “slow” side. In one embodiment, the appliance 200optionally removes the ACK tag from the packet before copying the packetto the other port. If the LAN/WAN detector 238 determines that thepacket is not tagged, the appliance 200 identifies or configures theport receiving the untagged packet as the “fast” side. The LAN/WANdetector 238 determines whether the SYN packet was tagged. If the SYNpacket was not tagged, the appliance 200 copied the packet to the otherport. If the SYN packet was tagged, the appliance tags the SYN-ACKpacket before copying it to the other port.

The appliance 200, 200′ may add, insert, modify, attach or otherwiseprovide any information or data in the TCP option header to provide anyinformation, data or characteristics about the network connection,network traffic flow, or the configuration or operation of the appliance200. In this manner, not only does an appliance 200 announce itspresence to another appliance 200′ or tag a higher or lower speedconnection, the appliance 200 provides additional information and datavia the TCP option headers about the appliance or the connection. TheTCP option header information may be useful to or used by an appliancein controlling, managing, optimizing, acceleration or improving thenetwork traffic flow traversing the appliance 200, or to otherwiseconfigure itself or operation of a network port.

Although generally described in conjunction with detecting speeds ofnetwork connections or the presence of appliances, the LAN/WAN detector238 can be used for applying any type of function, logic or operation ofthe appliance 200 to a port, connection or flow of network traffic. Inparticular, automated assignment of ports can occur whenever a deviceperforms different functions on different ports, where the assignment ofa port to a task can be made during the unit's operation, and/or thenature of the network segment on each port is discoverable by theappliance 200.

Flow Control

The flow controller 220 includes any logic, business rules, function oroperations for optimizing, accelerating or otherwise improving theperformance, operation or quality of service of transport layercommunications of network packets or the delivery of packets at thetransport layer. A flow controller, also sometimes referred to as a flowcontrol module, regulates, manages and controls data transfer rates. Insome embodiments, the flow controller 220 is deployed at or connected ata bandwidth bottleneck in the network 104. In one embodiment, the flowcontroller 220 effectively regulates, manages and controls bandwidthusage or utilization. In other embodiments, the flow control modules mayalso be deployed at points on the network of latency transitions (lowlatency to high latency) and on links with media losses (such aswireless or satellite links).

In some embodiments, a flow controller 220 may include a receiver-sideflow control module for controlling the rate of receipt of networktransmissions and a sender-side flow control module for the controllingthe rate of transmissions of network packets. In other embodiments, afirst flow controller 220 includes a receiver-side flow control moduleand a second flow controller 220′ includes a sender-side flow controlmodule. In some embodiments, a first flow controller 220 is deployed ona first appliance 200 and a second flow controller 220′ is deployed on asecond appliance 200′. As such, in some embodiments, a first appliance200 controls the flow of data on the receiver side and a secondappliance 200′ controls the data flow from the sender side. In yetanother embodiment, a single appliance 200 includes flow control forboth the receiver-side and sender-side of network communicationstraversing the appliance 200.

In one embodiment, a flow control module 220 is configured to allowbandwidth at the bottleneck to be more fully utilized, and in someembodiments, not overutilized. In some embodiments, the flow controlmodule 220 transparently buffers (or rebuffers data already buffered by,for example, the sender) network sessions that pass between nodes havingassociated flow control modules 220. When a session passes through twoor more flow control modules 220, one or more of the flow controlmodules controls a rate of the session(s).

In one embodiment, the flow control module 200 is configured withpredetermined data relating to bottleneck bandwidth. In anotherembodiment, the flow control module 220 may be configured to detect thebottleneck bandwidth or data associated therewith. A receiver-side flowcontrol module 220 may control the data transmission rate. Thereceiver-side flow control module controls 220 the sender-side flowcontrol module, e.g., 220, data transmission rate by forwardingtransmission rate limits to the sender-side flow control module 220. Inone embodiment, the receiver-side flow control module 220 piggybacksthese transmission rate limits on acknowledgement (ACK) packets (orsignals) sent to the sender, e.g., client 102, by the receiver, e.g.,server 106. The receiver-side flow control module 220 does this inresponse to rate control requests that are sent by the sender side flowcontrol module 220′. The requests from the sender-side flow controlmodule 220′ may be “piggybacked” on data packets sent by the sender 106.

In some embodiments, the flow controller 220 manipulates, adjusts,simulates, changes, improves or otherwise adapts the behavior of thetransport layer protocol to provide improved performance or operationsof delivery, data rates and/or bandwidth utilization of the transportlayer. The flow controller 220 may implement a plurality of data flowcontrol techniques at the transport layer, including but not limitedto 1) pre-acknowledgements, 2) window virtualization, 3) recongestiontechniques, 3) local retransmission techniques, 4) wavefront detectionand disambiguation, 5) transport control protocol selectiveacknowledgements, 6) transaction boundary detection techniques and 7)repacketization.

Although a sender may be generally described herein as a client 102 anda receiver as a server 106, a sender may be any end point such as aserver 106 or any computing device 100 on the network 104. Likewise, areceiver may be a client 102 or any other computing device on thenetwork 104.

Pre-Acknowledgements

In brief overview of a pre-acknowledgement flow control technique, theflow controller 220, in some embodiments, handles the acknowledgementsand retransmits for a sender, effectively terminating the sender'sconnection with the downstream portion of a network connection. Inreference to FIG. 1B, one possible deployment of an appliance 200 into anetwork architecture to implement this feature is depicted. In thisexample environment, a sending computer or client 102 transmits data onnetwork 104, for example, via a switch, which determines that the datais destined for VPN appliance 205. Because of the chosen networktopology, all data destined for VPN appliance 205 traverses appliance200, so the appliance 200 can apply any necessary algorithms to thisdata.

Continuing further with the example, the client 102 transmits a packet,which is received by the appliance 200. When the appliance 200 receivesthe packet, which is transmitted from the client 102 to a recipient viathe VPN appliance 205, the appliance 200 retains a copy of the packetand forwards the packet downstream to the VPN appliance 205. Theappliance 200 then generates an acknowledgement packet (ACK) and sendsthe ACK packet back to the client 102 or sending endpoint. This ACK, apre-acknowledgment, causes the sender 102 to believe that the packet hasbeen delivered successfully, freeing the sender's resources forsubsequent processing. The appliance 200 retains the copy of the packetdata in the event that a retransmission of the packet is required, sothat the sender 102 does not have to handle retransmissions of the data.This early generation of acknowledgements may be called “preacking.”

If a retransmission of the packet is required, the appliance 200retransmits the packet to the sender. The appliance 200 may determinewhether retransmission is required as a sender would in a traditionalsystem, for example, determining that a packet is lost if anacknowledgement has not been received for the packet after apredetermined amount of time. To this end, the appliance 200 monitorsacknowledgements generated by the receiving endpoint, e.g., server 106(or any other downstream network entity) so that it can determinewhether the packet has been successfully delivered or needs to beretransmitted. If the appliance 200 determines that the packet has beensuccessfully delivered, the appliance 200 is free to discard the savedpacket data. The appliance 200 may also inhibit forwardingacknowledgements for packets that have already been received by thesending endpoint.

In the embodiment described above, the appliance 200 via the flowcontroller 220 controls the sender 102 through the delivery ofpre-acknowledgements, also referred to as “preacks”, as though theappliance 200 was a receiving endpoint itself. Since the appliance 200is not an endpoint and does not actually consume the data, the appliance200 includes a mechanism for providing overflow control to the sendingendpoint. Without overflow control, the appliance 200 could run out ofmemory because the appliance 200 stores packets that have been preackedto the sending endpoint but not yet acknowledged as received by thereceiving endpoint. Therefore, in a situation in which the sender 102transmits packets to the appliance 200 faster than the appliance 200 canforward the packets downstream, the memory available in the appliance200 to store unacknowledged packet data can quickly fill. A mechanismfor overflow control allows the appliance 200 to control transmission ofthe packets from the sender 102 to avoid this problem.

In one embodiment, the appliance 200 or flow controller 220 includes aninherent “self-clocking” overflow control mechanism. This self-clockingis due to the order in which the appliance 200 may be designed totransmit packets downstream and send ACKs to the sender 102 or 106. Insome embodiments, the appliance 200 does not preack the packet untilafter it transmits the packet downstream. In this way, the sender 102will receive the ACKs at the rate at which the appliance 200 is able totransmit packets rather than the rate at which the appliance 200receives packets from the sender 100. This helps to regulate thetransmission of packets from a sender 102.

Window Virtualization

Another overflow control mechanism that the appliance 200 may implementis to use the TCP window size parameter, which tells a sender how muchbuffer the receiver is permitting the sender to fill up. A nonzerowindow size (e.g., a size of at least one Maximum Segment Size (MSS)) ina preack permits the sending endpoint to continue to deliver data to theappliance, whereas a zero window size inhibits further datatransmission. Accordingly, the appliance 200 may regulate the flow ofpackets from the sender, for example when the appliance's 200 buffer isbecoming full, by appropriately setting the TCP window size in eachpreack.

Another technique to reduce this additional overhead is to applyhysteresis. When the appliance 200 delivers data to the slower side, theoverflow control mechanism in the appliance 200 can require that aminimum amount of space be available before sending a nonzero windowadvertisement to the sender. In one embodiment, the appliance 200 waitsuntil there is a minimum of a predetermined number of packets, such asfour packets, of space available before sending a nonzero window packet,such as a packet indicating a window size of four packets. This mayreduce the overhead by approximately a factor of four, since only twoACK packets are sent for each group of four data packets, instead ofeight ACK packets for four data packets.

Another technique the appliance 200 or flow controller 220 may use foroverflow control is the TCP delayed ACK mechanism, which skips ACKs toreduce network traffic. The TCP delayed ACKs automatically delay thesending of an ACK, either until two packets are received or until afixed timeout has occurred. This mechanism alone can result in cuttingthe overhead in half; moreover, by increasing the numbers of packetsabove two, additional overhead reduction is realized. But merelydelaying the ACK itself may be insufficient to control overflow, and theappliance 200 may also use the advertised window mechanism on the ACKsto control the sender. When doing this, the appliance 200 in oneembodiment avoids triggering the timeout mechanism of the sender bydelaying the ACK too long.

In one embodiment, the flow controller 220 does not preack the lastpacket of a group of packets. By not preacking the last packet, or atleast one of the packets in the group, the appliance avoids a falseacknowledgement for a group of packets. For example, if the appliancewere to send a preack for a last packet and the packet were subsequentlylost, the sender would have been tricked into thinking that the packetis delivered when it was not. Thinking that the packet had beendelivered, the sender could discard that data. If the appliance alsolost the packet, there would be no way to retransmit the packet to therecipient. By not preacking the last packet of a group of packets, thesender will not discard the packet until it has been delivered.

In another embodiment, the flow controller 220 may use a windowvirtualization technique to control the rate of flow or bandwidthutilization of a network connection. Though it may not immediately beapparent from examining conventional literature such as RFC 1323, thereis effectively a send window for transport layer protocols such as TCP.The send window is similar to the receive window, in that it consumesbuffer space (though on the sender). The sender's send window consistsof all data sent by the application that has not been acknowledged bythe receiver. This data must be retained in memory in caseretransmission is required. Since memory is a shared resource, some TCPstack implementations limit the size of this data. When the send windowis full, an attempt by an application program to send more data resultsin blocking the application program until space is available. Subsequentreception of acknowledgements will free send-window memory and unblockthe application program. This window size is known as the socket buffersize in some TCP implementations.

In one embodiment, the flow control module 220 is configured to provideaccess to increased window (or buffer) sizes. This configuration mayalso be referenced to as window virtualization. In an embodimentincluding TCP as the transport layer protocol, the TCP header mayinclude a bit string corresponding to a window scale. In one embodiment,“window” may be referenced in a context of send, receive, or both.

One embodiment of window virtualization is to insert a preackingappliance 200 into a TCP session. In reference to any of theenvironments of FIG. 1A or 1B, initiation of a data communicationsession between a source node, e.g., client 102 (for ease of discussion,now referenced as source node 102), and a destination node, e.g., server106 (for ease of discussion, now referenced as destination node 106) isestablished. For TCP communications, the source node 102 initiallytransmits a synchronization signal (“SYN”) through its local areanetwork 104 to first flow control module 220. The first flow controlmodule 220 inserts a configuration identifier into the TCP headeroptions area. The configuration identifier identifies this point in thedata path as a flow control module.

The appliances 200 via a flow control module 220 provide window (orbuffer) to allow increasing data buffering capabilities within a sessiondespite having end nodes with small buffer sizes, e.g., typically 16 kbytes. However, RFC 1323 requires window scaling for any buffer sizesgreater than 64 k bytes, which must be set at the time of sessioninitialization (SYN, SYN-ACK signals). Moreover, the window scalingcorresponds to the lowest common denominator in the data path, often anend node with small buffer size. This window scale often is a scale of 0or 1, which corresponds to a buffer size of up to 64 k or 128 k bytes.Note that because the window size is defined as the window field in eachpacket shifted over by the window scale, the window scale establishes anupper limit for the buffer, but does not guarantee the buffer isactually that large. Each packet indicates the current available bufferspace at the receiver in the window field.

In one embodiment of scaling using the window virtualization technique,during connection establishment (i.e., initialization of a session) whenthe first flow control module 220 receives from the source node 102 theSYN signal (or packet), the flow control module 220 stores the windowsscale of the source node 102 (which is the previous node) or stores a 0for window scale if the scale of the previous node is missing. The firstflow control module 220 also modifies the scale, e.g., increases thescale to 4 from 0 or 1, in the SYN-FCM signal. When the second flowcontrol module 220 receives the SYN signal, it stores the increasedscale from the first flow control signal and resets the scale in the SYNsignal back to the source node 103 scale value for transmission to thedestination node 106. When the second flow controller 220 receives theSYN-ACK signal from the destination node 106, it stores the scale fromthe destination node 106 scale, e.g., 0 or 1, and modifies it to anincreased scale that is sent with the SYN-ACK-FCM signal. The first flowcontrol node 220 receives and notes the received window scale andrevises the windows scale sent back to the source node 102 back down tothe original scale, e.g., 0 or 1. Based on the above window shiftconversation during connection establishment, the window field in everysubsequent packet, e.g., TCP packet, of the session must be shiftedaccording to the window shift conversion.

The window scale, as described above, expresses buffer sizes of over 64k and may not be required for window virtualization. Thus, shifts forwindow scale may be used to express increased buffer capacity in eachflow control module 220. This increase in buffer capacity in may bereferenced as window (or buffer) virtualization. The increase in buffersize allows greater packet throughput from and to the respective endnodes 102 and 106. Note that buffer sizes in TCP are typically expressedin terms of bytes, but for ease of discussion “packets” may be used inthe description herein as it relates to virtualization.

By way of example, a window (or buffer) virtualization performed by theflow controller 220 is described. In this example, the source node 102and the destination node 106 are configured similar to conventional endnodes having a limited buffer capacity of 16 k bytes, which equalsapproximately 10 packets of data. Typically, an end node 102, 106 mustwait until the packet is transmitted and confirmation is received beforea next group of packets can be transmitted. In one embodiment, usingincreased buffer capacity in the flow control modules 220, when thesource node 103 transmits its data packets, the first flow controlmodule 220 receives the packets, stores it in its larger capacitybuffer, e.g., 512 packet capacity, and immediately sends back anacknowledgement signal indicating receipt of the packets (“REC-ACK”)back to the source node 102. The source node 102 can then “flush” itscurrent buffer, load the buffer with 10 new data packets, and transmitthose onto the first flow control module 220. Again, the first flowcontrol module 220 transmits a REC-ACK signal back to the source node102 and the source node 102 flushes its buffer and loads it with 10 morenew packets for transmission.

As the first flow control module 220 receives the data packets from thesource nodes, it loads up its buffer accordingly. When it is ready thefirst flow control module 220 can begin transmitting the data packets tothe second flow control module 230, which also has an increased buffersize, for example, to receive 512 packets. The second flow controlmodule 220′ receives the data packets and begins to transmit 10 packetsat a time to the destination node 106. Each REC-ACK received at thesecond flow control node 220 from the destination node 106 results in 10more packets being transmitted to the destination node 106 until all thedata packets are transferred. Hence, the present invention is able toincrease data transmission throughput between the source node (sender)102 and the destination node (receiver) 106 by taking advantage of thelarger buffer in the flow control modules 220, 220′ between the devices.

It is noted that by “preacking” the transmission of data as describedpreviously, a sender (or source node 102) is allowed to transmit moredata than is possible without the preacks, thus affecting a largerwindow size. For example, in one embodiment this technique is effectivewhen the flow control module 220, 220′ is located “near” a node (e.g.,source node 102 or destination node 106) that lacks large windows.

Recongestion

Another technique or algorithm of the flow controller 220 is referred toas recongestion. The standard TCP congestion avoidance algorithms areknown to perform poorly in the face of certain network conditions,including: large RTTs (round trip times), high packet loss rates, andothers. When the appliance 200 detects a congestion condition such aslong round trip times or high packet loss, the appliance 200 intervenes,substituting an alternate congestion avoidance algorithm that bettersuits the particular network condition. In one embodiment, therecongestion algorithm uses preacks to effectively terminate theconnection between the sender and the receiver. The appliance 200 thenresends the packets from itself to the receiver, using a differentcongestion avoidance algorithm. Recongestion algorithms may be dependenton the characteristics of the TCP connection. The appliance 200 monitorseach TCP connection, characterizing it with respect to the differentdimensions, selecting a recongestion algorithm that is appropriate forthe current characterization.

In one embodiment, upon detecting a TCP connection that is limited byround trip times (RTT), a recongestion algorithm is applied whichbehaves as multiple TCP connections. Each TCP connection operates withinits own performance limit but the aggregate bandwidth achieves a higherperformance level. One parameter in this mechanism is the number ofparallel connections that are applied (N). Too large a value of N andthe connection bundle achieves more than its fair share of bandwidth.Too small a value of N and the connection bundle achieves less than itsfair share of bandwidth. One method of establishing “N” relies on theappliance 200 monitoring the packet loss rate, RTT, and packet size ofthe actual connection. These numbers are plugged into a TCP responsecurve formula to provide an upper limit on the performance of a singleTCP connection in the present configuration. If each connection withinthe connection bundle is achieving substantially the same performance asthat computed to be the upper limit, then additional parallelconnections are applied. If the current bundle is achieving lessperformance than the upper limit, the number of parallel connections isreduced. In this manner, the overall fairness of the system ismaintained since individual connection bundles contain no moreparallelism than is required to eliminate the restrictions imposed bythe protocol itself. Furthermore, each individual connection retains TCPcompliance.

Another method of establishing “N” is to utilize a parallel flow controlalgorithm such as the TCP “Vegas” algorithm or the TCP “StabilizedVegas” algorithm. In this method, the network information associatedwith the connections in the connection bundle (e.g., RTT, loss rate,average packet size, etc.) is aggregated and applied to the alternateflow control algorithm. The results of this algorithm are in turndistributed among the connections of the bundle controlling their number(i.e., N). Optionally, each connection within the bundle continues usingthe standard TCP congestion avoidance algorithm.

In another embodiment, the individual connections within a parallelbundle are virtualized, i.e., actual individual TCP connections are notestablished. Instead the congestion avoidance algorithm is modified tobehave as though there were N parallel connections. This method has theadvantage of appearing to transiting network nodes as a singleconnection. Thus the QOS, security and other monitoring methods of thesenodes are unaffected by the recongestion algorithm. In yet anotherembodiment, the individual connections within a parallel bundle arereal, i.e., a separate. TCP connection is established for each of theparallel connections within a bundle. The congestion avoidance algorithmfor each TCP connection need not be modified.

Retransmission

In some embodiments, the flow controller 220 may apply a localretransmission technique. One reason for implementing preacks is toprepare to transit to a high-loss link (e.g., wireless). In theseembodiments, the preacking appliance 200 or flow control module 220 islocated most beneficially “before” the wireless link. This allowsretransmissions to be performed closer to the high loss link, removingthe retransmission burden from the remainder of the network. Theappliance 200 may provide local retransmission, in which case, packetsdropped due to failures of the link are retransmitted directly by theappliance 200. This is advantageous because it eliminates theretransmission burden upon an end node, such as server 106, andinfrastructure of any of the networks 104. With appliance 200 providinglocal retransmissions, the dropped packet can be retransmitted acrossthe high loss link without necessitating a retransmit by an end node anda corresponding decrease in the rate of data transmission from the endnode.

Another reason for implementing preacks is to avoid a receive time out(RTO) penalty. In standard TCP there are many situations that result inan RTO, even though a large percentage of the packets in flight weresuccessfully received. With standard TCP algorithms, dropping more thanone packet within an RTT window would likely result in a timeout.Additionally, most TCP connections experience a timeout if aretransmitted packet is dropped. In a network with a high bandwidthdelay product, even a relatively small packet loss rate will causefrequent Retransmission timeouts (RTOs). In one embodiment, theappliance 200 uses a retransmit and timeout algorithm is avoid prematureRTOs. The appliance 200 or flow controller 220 maintains a count ofretransmissions is maintained on a per-packet basis. Each time that apacket is retransmitted, the count is incremented by one and theappliance 200 continues to transmit packets. In some embodiments, onlyif a packet has been retransmitted a predetermined number of times is anRTO declared.

Wavefront Detection and Disambiguation

In some embodiments, the appliance 200 or flow controller 220 useswavefront detection and disambiguation techniques in managing andcontrolling flow of network traffic. In this technique, the flowcontroller 220 uses transmit identifiers or numbers to determine whetherparticular data packets need to be retransmitted. By way of example, asender transmits data packets over a network, where each instance of atransmitted data packet is associated with a transmit number. It can beappreciated that the transmit number for a packet is not the same as thepacket's sequence number, since a sequence number references the data inthe packet while the transmit number references an instance of atransmission of that data. The transmit number can be any informationusable for this purpose, including a timestamp associated with a packetor simply an increasing number (similar to a sequence number or a packetnumber). Because a data segment may be retransmitted, different transmitnumbers may be associated with a particular sequence number.

As the sender transmits data packets, the sender maintains a datastructure of acknowledged instances of data packet transmissions. Eachinstance of a data packet transmission is referenced by its sequencenumber and transmit number. By maintaining a transmit number for eachpacket, the sender retains the ordering of the transmission of datapackets. When the sender receives an ACK or a SACK, the senderdetermines the highest transmit number associated with packets that thereceiver indicated has arrived (in the received acknowledgement). Anyoutstanding unacknowledged packets with lower transmit numbers arepresumed lost.

In some embodiments, the sender is presented with an ambiguous situationwhen the arriving packet has been retransmitted: a standard ACK/SACKdoes not contain enough information to allow the sender to determinewhich transmission of the arriving packet has triggered theacknowledgement. After receiving an ambiguous acknowledgement,therefore, the sender disambiguates the acknowledgement to associate itwith a transmit number. In various embodiments, one or a combination ofseveral techniques may be used to resolve this ambiguity.

In one embodiment, the sender includes an identifier with a transmitteddata packet, and the receiver returns that identifier or a functionthereof with the acknowledgement. The identifier may be a timestamp(e.g., a TCP timestamp as described in RFC 1323), a sequential number,or any other information that can be used to resolve between two or moreinstances of a packet's transmission. In an embodiment in which the TCPtimestamp option is used to disambiguate the acknowledgement, eachpacket is tagged with up to 32-bits of unique information. Upon receiptof the data packet, the receiver echoes this unique information back tothe sender with the acknowledgement. The sender ensures that theoriginally sent packet and its retransmitted version or versions containdifferent values for the timestamp option, allowing it to unambiguouslyeliminate the ACK ambiguity. The sender may maintain this uniqueinformation, for example, in the data structure in which it stores thestatus of sent data packets. This technique is advantageous because itcomplies with industry standards and is thus likely to encounter littleor no interoperability issues. However, this technique may require tenbytes of TCP header space in some implementations, reducing theeffective throughput rate on the network and reducing space availablefor other TCP options.

In another embodiment, another field in the packet, such as the IP IDfield, is used to disambiguate in a way similar to the TCP timestampoption described above. The sender arranges for the ID field values ofthe original and the retransmitted version or versions of the packet tohave different ID fields in the IP header. Upon reception of the datapacket at the receiver, or a proxy device thereof, the receiver sets theID field of the ACK packet to a function of the ID field of the packetthat triggers the ACK. This method is advantageous, as it requires noadditional data to be sent, preserving the efficiency of the network andTCP header space. The function chosen should provide a high degree oflikelihood of providing disambiguation. In a preferred embodiment, thesender selects IP ID values with the most significant bit set to 0. Whenthe receiver responds, the IP ID value is set to the same IP ID valuewith the most significant bit set to a one.

In another embodiment, the transmit numbers associated withnon-ambiguous acknowledgements are used to disambiguate an ambiguousacknowledgement. This technique is based on the principle thatacknowledgements for two packets will tend to be received closer in timeas the packets are transmitted closer in time. Packets that are notretransmitted will not result in ambiguity, as the acknowledgementsreceived for such packets can be readily associated with a transmitnumber. Therefore, these known transmit numbers are compared to thepossible transmit numbers for an ambiguous acknowledgement received nearin time to the known acknowledgement. The sender compares the transmitnumbers of the ambiguous acknowledgement against the last known receivedtransmit number, selecting the one closest to the known receivedtransmit number. For example, if an acknowledgement for data packet 1 isreceived and the last received acknowledgement was for data packet 5,the sender resolves the ambiguity by assuming that the third instance ofdata packet 1 caused the acknowledgement.

Selective Acknowledgements

Another technique of the appliance 200 or flow controller 220 is toimplement an embodiment of transport control protocol selectiveacknowledgements, or TCP SACK, to determine what packets have or havenot been received. This technique allows the sender to determineunambiguously a list of packets that have been received by the receiveras well as an accurate list of packets not received. This functionalitymay be implemented by modifying the sender and/or receiver, or byinserting sender- and receiver-side flow control modules 220 in thenetwork path between the sender and receiver. In reference to FIG. 1A orFIG. 1B, a sender, e.g., client 102, is configured to transmit datapackets to the receiver, e.g., server 106, over the network 104. Inresponse, the receiver returns a TCP Selective Acknowledgment option,referred to as SACK packet to the sender. In one embodiment, thecommunication is bi-directional, although only one direction ofcommunication is discussed here for simplicity. The receiver maintains alist, or other suitable data structure, that contains a group of rangesof sequence numbers for data packets that the receiver has actuallyreceived. In some embodiments, the list is sorted by sequence number inan ascending or descending order. The receiver also maintains a left-offpointer, which comprises a reference into the list and indicates theleft-off point from the previously generated SACK packet.

Upon reception of a data packet, the receiver generates and transmits aSACK packet back to the sender. In some embodiments, the SACK packetincludes a number of fields, each of which can hold a range of sequencenumbers to indicate a set of received data packets. The receiver fillsthis first field of the SACK packet with a range of sequence numbersthat includes the landing packet that triggered the SACK packet. Theremaining available SACK fields are filled with ranges of sequencenumbers from the list of received packets. As there are more ranges inthe list than can be loaded into the SACK packet, the receiver uses theleft-off pointer to determine which ranges are loaded into the SACKpacket. The receiver inserts the SACK ranges consecutively from thesorted list, starting from the range referenced by the pointer andcontinuing down the list until the available SACK range space in the TCPheader of the SACK packet is consumed. The receiver wraps around to thestart of the list if it reaches the end. In some embodiments, two orthree additional SACK ranges can be added to the SACK range information.

Once the receiver generates the SACK packet, the receiver sends theacknowledgement back to the sender. The receiver then advances theleft-off pointer by one or more SACK range entries in the list. If thereceiver inserts four SACK ranges, for example, the left-off pointer maybe advanced two SACK ranges in the list. When the advanced left-offpointer reaches at the end of the list, the pointer is reset to thestart of the list, effectively wrapping around the list of knownreceived ranges. Wrapping around the list enables the system to performwell, even in the presence of large losses of SACK packets, since theSACK information that is not communicated due to a lost SACK packet willeventually be communicated once the list is wrapped around.

It can be appreciated, therefore, that a SACK packet may communicateseveral details about the condition of the receiver. First, the SACKpacket indicates that, upon generation of the SACK packet, the receiverhad just received a data packet that is within the first field of theSACK information. Secondly, the second and subsequent fields of the SACKinformation indicate that the receiver has received the data packetswithin those ranges. The SACK information also implies that the receiverhad not, at the time of the SACK packet's generation, received any ofthe data packets that fall between the second and subsequent fields ofthe SACK information. In essence, the ranges between the second andsubsequent ranges in the SACK information are “holes” in the receiveddata, the data therein known not to have been delivered. Using thismethod, therefore, when a SACK packet has sufficient space to includemore than two SACK ranges, the receiver may indicate to the sender arange of data packets that have not yet been received by the receiver.

In another embodiment, the sender uses the SACK packet described abovein combination with the retransmit technique described above to makeassumptions about which data packets have been delivered to thereceiver. For example, when the retransmit algorithm (using the transmitnumbers) declares a packet lost, the sender considers the packet to beonly conditionally lost, as it is possible that the SACK packetidentifying the reception of this packet was lost rather than the datapacket itself. The sender thus adds this packet to a list of potentiallylost packets, called the presumed lost list. Each time a SACK packetarrives, the known missing ranges of data from the SACK packet arecompared to the packets in the presumed lost list. Packets that containdata known to be missing are declared actually lost and are subsequentlyretransmitted. In this way, the two schemes are combined to give thesender better information about which packets have been lost and need tobe retransmitted.

Transaction Boundary Detection

In some embodiments, the appliance 200 or flow controller 220 applies atechnique referred to as transaction boundary detection. In oneembodiment, the technique pertains to ping-pong behaved connections. Atthe TCP layer, ping-pong behavior is when one communicant—a sender-sends data and then waits for a response from the other communicant—thereceiver. Examples of ping-pong behavior include remote procedure call,HTTP and others. The algorithms described above use retransmissiontimeout (RTO) to recover from the dropping of the last packet or packetsassociated with the transaction. Since the TCP RTO mechanism isextremely coarse in some embodiments, for example requiring a minimumone second value in all cases), poor application behavior may be seen inthese situations.

In one embodiment, the sender of data or a flow control module 220coupled to the sender detects a transaction boundary in the data beingsent. Upon detecting a transaction boundary, the sender or a flowcontrol module 220 sends additional packets, whose reception generatesadditional ACK or SACK responses from the receiver. Insertion of theadditional packets is preferably limited to balance between improvedapplication response time and network capacity utilization. The numberof additional packets that is inserted may be selected according to thecurrent loss rate associated with that connection, with more packetsselected for connections having a higher loss rate.

One method of detecting a transaction boundary is time based. If thesender has been sending data and ceases, then after a period of time thesender or flow control module 200 declares a transaction boundary. Thismay be combined with other techniques. For example, the setting of thePSH (TCP Push) bit by the sender in the TCP header may indicate atransaction boundary. Accordingly, combining the time-based approachwith these additional heuristics can provide for more accurate detectionof a transaction boundary. In another technique, if the sender or flowcontrol module 220 understands the application protocol, it can parsethe protocol data stream and directly determine transaction boundaries.In some embodiment, this last behavior can be used independent of anytime-based mechanism.

Responsive to detecting a transaction boundary, the sender or flowcontrol module 220 transmits additional data packets to the receiver tocause acknowledgements therefrom. The additional data packets shouldtherefore be such that the receiver will at least generate an ACK orSACK in response to receiving the data packet. In one embodiment, thelast packet or packets of the transaction are simply retransmitted. Thishas the added benefit of retransmitting needed data if the last packetor packets had been dropped, as compared to merely sending dummy datapackets. In another embodiment, fractions of the last packet or packetsare sent, allowing the sender to disambiguate the arrival of thesepackets from their original packets. This allows the receiver to avoidfalsely confusing any reordering adaptation algorithms. In anotherembodiment, any of a number of well-known forward error correctiontechniques can be used to generate additional data for the insertedpackets, allowing for the reconstruction of dropped or otherwise missingdata at the receiver.

In some embodiments, the boundary detection technique described hereinhelps to avoid a timeout when the acknowledgements for the last datapackets in a transaction are dropped. When the sender or flow controlmodule 220 receives the acknowledgements for these additional datapackets, the sender can determine from these additional acknowledgementswhether the last data packets have been received or need to beretransmitted, thus avoiding a timeout. In one embodiment, if the lastpackets have been received but their acknowledgements were dropped, aflow control module 220 generates an acknowledgement for the datapackets and sends the acknowledgement to the sender, thus communicatingto the sender that the data packets have been delivered. In anotherembodiment, if the last packets have not been received, a flow controlmodule 200 sends a packet to the sender to cause the sender toretransmit the dropped data packets.

Repacketization

In yet another embodiment, the appliance 200 or flow controller 220applies a repacketization technique for improving the flow of transportlayer network traffic. In some embodiments, performance of TCP isproportional to packet size. Thus increasing packet sizes improvesperformance unless it causes substantially increased packet loss ratesor other nonlinear effects, like IP fragmentation. In general, wiredmedia (such as copper or fibre optics) have extremely low bit-errorrates, low enough that these can be ignored. For these media, it isadvantageous for the packet size to be the maximum possible beforefragmentation occurs (the maximum packet size is limited by theprotocols of the underlying transmission media). Whereas fortransmission media with higher loss rates (e.g., wireless technologiessuch as WiFi, etc., or high-loss environments such as power-linenetworking, etc.), increasing the packet size may lead to lowertransmission rates, as media-induced errors cause an entire packet to bedropped (i.e., media-induced errors beyond the capability of thestandard error correcting code for that media), increasing the packetloss rate. A sufficiently large increase in the packet loss rate willactually negate any performance benefit of increasing packet size. Insome cases, it may be difficult for a TCP endpoint to choose an optimalpacket size. For example, the optimal packet size may vary across thetransmission path, depending on the nature of each link.

By inserting an appliance 200 or flow control module 220 into thetransmission path, the flow controller 220 monitors characteristics ofthe link and repacketizes according to determined link characteristics.In one embodiment, an appliance 200 or flow controller 220 repacketizespackets with sequential data into a smaller number of larger packets. Inanother embodiment, an appliance 200 or flow controller 220 repacketizespackets by breaking part a sequence of large packets into a largernumber of smaller packets. In other embodiments, an appliance 200 orflow controller 220 monitors the link characteristics and adjusts thepacket sizes through recombination to improve throughput.

QoS

Still referring to FIG. 2A, the flow controller 220, in someembodiments, may include a QoS Engine 236, also referred to as a QoScontroller. In another embodiment, the appliance 200 and/or networkoptimization engine 250 includes the QoS engine 236, for example,separately but in communication with the flow controller 220. The QoSEngine 236 includes any logic, business rules, function or operationsfor performing one or more Quality of Service (QoS) techniques improvingthe performance, operation or quality of service of any of the networkconnections. In some embodiments, the QoS engine 236 includes networktraffic control and management mechanisms that provide differentpriorities to different users, applications, data flows or connections.In other embodiments, the QoS engine 236 controls, maintains, or assuresa certain level of performance to a user, application, data flow orconnection. In one embodiment, the QoS engine 236 controls, maintains orassures a certain portion of bandwidth or network capacity for a user,application, data flow or connection. In some embodiments, the QoSengine 236 monitors the achieved level of performance or the quality ofservice corresponding to a user, application, data flow or connection,for example, the data rate and delay. In response to monitoring, the QoSengine 236 dynamically controls or adjusts scheduling priorities ofnetwork packets to achieve the desired level of performance or qualityof service.

In some embodiments, the QoS engine 236 prioritizes, schedules andtransmits network packets according to one or more classes or levels ofservices. In some embodiments, the class or level service mayinclude: 1) best efforts, 2) controlled load, 3) guaranteed or 4)qualitative. For a best efforts class of service, the appliance 200makes reasonable effort to deliver packets (a standard service level).For a controlled load class of service, the appliance 200 or QoS engine236 approximates the standard packet error loss of the transmissionmedium or approximates the behavior of best-effort service in lightlyloaded network conditions. For a guaranteed class of serivce, theappliance 200 or QoS engine 236 guarantees the ability to transmit dataat a determined rate for the duration of the connection. For aqualitative class of service, the appliance 200 or QoS engine 236 thequalitative service class is used for applications, users, data flows orconnection that require or desire prioritized traffic but cannotquantify resource needs or level of service. In these cases, theappliance 200 or QoS engine 236 determines the class of service orprioritization based on any logic or configuration of the QoS engine 236or based on business rules or policies. For example, in one embodiment,the QoS engine 236 prioritizes, schedules and transmits network packetsaccording to one or more policies as specified by the policy engine 295,295′.

Protocol Acceleration

The protocol accelerator 234 includes any logic, business rules,function or operations for optimizing, accelerating, or otherwiseimproving the performance, operation or quality of service of one ormore protocols. In one embodiment, the protocol accelerator 234accelerates any application layer protocol or protocols at layers 5-7 ofthe network stack. In other embodiments, the protocol accelerator 234accelerates a transport layer or a layer 4 protocol. In one embodiment,the protocol accelerator 234 accelerates layer 2 or layer 3 protocols.In some embodiments, the protocol accelerator 234 is configured,constructed or designed to optimize or accelerate each of one or moreprotocols according to the type of data, characteristics and/or behaviorof the protocol. In another embodiment, the protocol accelerator 234 isconfigured, constructed or designed to improve a user experience,response times, network or computer load, and/or network or bandwidthutilization with respect to a protocol.

In one embodiment, the protocol accelerator 234 is configured,constructed or designed to minimize the effect of WAN latency on filesystem access. In some embodiments, the protocol accelerator 234optimizes or accelerates the use of the CIFS (Common Internet FileSystem) protocol to improve file system access times or access times todata and files. In some embodiments, the protocol accelerator 234optimizes or accelerates the use of the NFS (Network File System)protocol. In another embodiment, the protocol accelerator 234 optimizesor accelerates the use of the File Transfer protocol (FTP).

In one embodiment, the protocol accelerator 234 is configured,constructed or designed to optimize or accelerate a protocol carrying asa payload or using any type and form of markup language. In otherembodiments, the protocol accelerator 234 is configured, constructed ordesigned to optimize or accelerate a HyperText Transfer Protocol (HTTP).In another embodiment, the protocol accelerator 234 is configured,constructed or designed to optimize or accelerate a protocol carrying asa payload or otherwise using XML (eXtensible Markup Language).

Transparency and Multiple Deployment Configurations

In some embodiments, the appliance 200 and/or network optimizationengine 250 is transparent to any data flowing across a networkconnection or link, such as a WAN link. In one embodiment, the appliance200 and/or network optimization engine 250 operates in such a mannerthat the data flow across the WAN is recognizable by any networkmonitoring, QOS management or network analysis tools. In someembodiments, the appliance 200 and/or network optimization engine 250does not create any tunnels or streams for transmitting data that mayhide, obscure or otherwise make the network traffic not transparent. Inother embodiments, the appliance 200 operates transparently in that theappliance does not change any of the source and/or destination addressinformation or port information of a network packet, such as internetprotocol addresses or port numbers. In other embodiments, the appliance200 and/or network optimization engine 250 is considered to operate orbehave transparently to the network, an application, client, server orother appliances or computing device in the network infrastructure. Thatis, in some embodiments, the appliance is transparent in that networkrelated configuration of any device or appliance on the network does notneed to be modified to support the appliance 200.

The appliance 200 may be deployed in any of the following deploymentconfigurations: 1) in-line of traffic, 2) in proxy mode, or 3) in avirtual in-line mode. In some embodiments, the appliance 200 may bedeployed inline to one or more of the following: a router, a client, aserver or another network device or appliance. In other embodiments, theappliance 200 may be deployed in parallel to one or more of thefollowing: a router, a client, a server or another network device orappliance. In parallel deployments, a client, server, router or othernetwork appliance may be configured to forward, transfer or transitnetworks to or via the appliance 200.

In the embodiment of in-line, the appliance 200 is deployed inline witha WAN link of a router. In this way, all traffic from the WAN passesthrough the appliance before arriving at a destination of a LAN.

In the embodiment of a proxy mode, the appliance 200 is deployed as aproxy device between a client and a server. In some embodiments, theappliance 200 allows clients to make indirect connections to a resourceon a network. For example, a client connects to a resource via theappliance 200, and the appliance provides the resource either byconnecting to the resource, a different resource, or by serving theresource from a cache. In some cases, the appliance may alter theclient's request or the server's response for various purposes, such asfor any of the optimization techniques discussed herein. In oneembodiment, the client 102 send requests addressed to the proxy. In onecase, the proxy responds to the client in place of or acting as a server106. In other embodiments, the appliance 200 behaves as a transparentproxy, by intercepting and forwarding requests and responsestransparently to a client and/or server. Without client-sideconfiguration, the appliance 200 may redirect client requests todifferent servers or networks. In some embodiments, the appliance 200may perform any type and form of network address translation, referredto as NAT, on any network traffic traversing the appliance.

In some embodiments, the appliance 200 is deployed in a virtual in-linemode configuration. In this embodiment, a router or a network devicewith routing or switching functionality is configured to forward,reroute or otherwise provide network packets destined to a network tothe appliance 200. The appliance 200 then performs any desiredprocessing on the network packets, such as any of the WAN optimizationtechniques discussed herein. Upon completion of processing, theappliance 200 forwards the processed network packet to the router totransmit to the destination on the network. In this way, the appliance200 can be coupled to the router in parallel but still operate as it ifthe appliance 200 were inline. This deployment mode also providestransparency in that the source and destination addresses and portinformation are preserved as the packet is processed and transmitted viathe appliance through the network.

End Node Deployment

Although the network optimization engine 250 is generally describedabove in conjunction with an appliance 200, the network optimizationengine 250, or any portion thereof, may be deployed, distributed orotherwise operated on any end node, such as a client 102 and/or server106. As such, a client or server may provide any of the systems andmethods of the network optimization engine 250 described herein inconjunction with one or more appliances 200 or without an appliance 200.

Referring now to FIG. 2B, an example embodiment of the networkoptimization engine 250 deployed on one or more end nodes is depicted.In brief overview, the client 102 may include a first networkoptimization engine 250′ and the server 106 may include a second networkoptimization engine 250″. The client 102 and server 106 may establish atransport layer connection and exchange communications with or withouttraversing an appliance 200.

In one embodiment, the network optimization engine 250′ of the client102 performs the techniques described herein to optimize, accelerate orotherwise improve the performance, operation or quality of service ofnetwork traffic communicated with the server 106. In another embodiment,the network optimization engine 250″ of the server 106 performs thetechniques described herein to optimize, accelerate or otherwise improvethe performance, operation or quality of service of network trafficcommunicated with the client 102. In some embodiments, the networkoptimization engine 250′ of the client 102 and the network optimizationengine 250″ of the server 106 perform the techniques described herein tooptimize, accelerate or otherwise improve the performance, operation orquality of service of network traffic communicated between the client102 and the server 106. In yet another embodiment, the networkoptimization engine 250′ of the client 102 performs the techniquesdescribed herein in conjunction with an appliance 200 to optimize,accelerate or otherwise improve the performance, operation or quality ofservice of network traffic communicated with the client 102. In stillanother embodiment, the network optimization engine 250″ of the server106 performs the techniques described herein in conjunction with anappliance 200 to optimize, accelerate or otherwise improve theperformance, operation or quality of service of network trafficcommunicated with the server 106.

C. Client Agent

As illustrated in FIGS. 2A and 2B, a client deployed in the system orwith an appliance 200 or 205 may include a client agent 120. In oneembodiment, the client agent 120 is used to facilitate communicationswith one or more appliances 200 or 205. In some embodiments, any of thesystems and methods of the appliance 200 or 205 described herein may bedeployed, implemented or embodied in a client, such as via a clientagent 120. In other embodiments, the client agent 120 may includeapplications, programs, or agents providing additional functionalitysuch as end point detection and authorization, virtual private networkconnectivity, and application streaming. Prior to discussing otherembodiments of systems and methods of the appliance 200, embodiments ofthe client agent 120 will be described.

Referring now to FIG. 3, an embodiment of a client agent 120 isdepicted. The client 102 has a client agent 120 for establishing,exchanging, managing or controlling communications with the appliance200, appliance 205 and/or server 106 via a network 104. In someembodiments, the client agent 120, which may also be referred to as aWAN client, accelerates WAN network communications and/or is used tocommunicate via appliance 200 on a network. In brief overview, theclient 102 operates on computing device 100 having an operating systemwith a kernel mode 302 and a user mode 303, and a network stack 267 withone or more layers 310 a-310 b. The client 102 may have installed and/orexecute one or more applications. In some embodiments, one or moreapplications may communicate via the network stack 267 to a network 104.One of the applications, such as a web browser, may also include a firstprogram 322. For example, the first program 322 may be used in someembodiments to install and/or execute the client agent 120, or anyportion thereof. The client agent 120 includes an interceptionmechanism, or interceptor 350, for intercepting network communicationsfrom the network stack 267 from the one or more applications.

As with the appliance 200, the client has a network stack 267 includingany type and form of software, hardware, or any combinations thereof,for providing connectivity to and communications with a network 104. Thenetwork stack 267 of the client 102 includes any of the network stackembodiments described above in conjunction with the appliance 200. Insome embodiments, the client agent 120, or any portion thereof, isdesigned and constructed to operate with or work in conjunction with thenetwork stack 267 installed or otherwise provided by the operatingsystem of the client 102.

In further details, the network stack 267 of the client 102 or appliance200 (or 205) may include any type and form of interfaces for receiving,obtaining, providing or otherwise accessing any information and datarelated to network communications of the client 102. In one embodiment,an interface to the network stack 267 includes an applicationprogramming interface (API). The interface may also have any functioncall, hooking or filtering mechanism, event or call back mechanism, orany type of interfacing technique. The network stack 267 via theinterface may receive or provide any type and form of data structure,such as an object, related to functionality or operation of the networkstack 267. For example, the data structure may include information anddata related to a network packet or one or more network packets. In someembodiments, the data structure includes, references or identifies aportion of the network packet processed at a protocol layer of thenetwork stack 267, such as a network packet of the transport layer. Insome embodiments, the data structure 325 is a kernel-level datastructure, while in other embodiments, the data structure 325 is auser-mode data structure. A kernel-level data structure may have a datastructure obtained or related to a portion of the network stack 267operating in kernel-mode 302, or a network driver or other softwarerunning in kernel-mode 302, or any data structure obtained or receivedby a service, process, task, thread or other executable instructionsrunning or operating in kernel-mode of the operating system.

Additionally, some portions of the network stack 267 may execute oroperate in kernel-mode 302, for example, the data link or network layer,while other portions execute or operate in user-mode 303, such as anapplication layer of the network stack 267. For example, a first portion310 a of the network stack may provide user-mode access to the networkstack 267 to an application while a second portion 310 a of the networkstack 267 provides access to a network. In some embodiments, a firstportion 310 a of the network stack has one or more upper layers of thenetwork stack 267, such as any of layers 5-7. In other embodiments, asecond portion 310 b of the network stack 267 includes one or more lowerlayers, such as any of layers 1-4. Each of the first portion 310 a andsecond portion 310 b of the network stack 267 may include any portion ofthe network stack 267, at any one or more network layers, in user-mode303, kernel-mode, 302, or combinations thereof, or at any portion of anetwork layer or interface point to a network layer or any portion of orinterface point to the user-mode 302 and kernel-mode 203.

The interceptor 350 may include software, hardware, or any combinationof software and hardware. In one embodiment, the interceptor 350intercepts or otherwise receives a network communication at any point inthe network stack 267, and redirects or transmits the networkcommunication to a destination desired, managed or controlled by theinterceptor 350 or client agent 120. For example, the interceptor 350may intercept a network communication of a network stack 267 of a firstnetwork and transmit the network communication to the appliance 200 fortransmission on a second network 104. In some embodiments, theinterceptor 350 includes or is a driver, such as a network driverconstructed and designed to interface and work with the network stack267. In some embodiments, the client agent 120 and/or interceptor 350operates at one or more layers of the network stack 267, such as at thetransport layer. In one embodiment, the interceptor 350 includes afilter driver, hooking mechanism, or any form and type of suitablenetwork driver interface that interfaces to the transport layer of thenetwork stack, such as via the transport driver interface (TDI). In someembodiments, the interceptor 350 interfaces to a first protocol layer,such as the transport layer and another protocol layer, such as anylayer above the transport protocol layer, for example, an applicationprotocol layer. In one embodiment, the interceptor 350 includes a drivercomplying with the Network Driver Interface Specification (NDIS), or aNDIS driver. In another embodiment, the interceptor 350 may be amin-filter or a mini-port driver. In one embodiment, the interceptor350, or portion thereof, operates in kernel-mode 202. In anotherembodiment, the interceptor 350, or portion thereof, operates inuser-mode 203. In some embodiments, a portion of the interceptor 350operates in kernel-mode 202 while another portion of the interceptor 350operates in user-mode 203. In other embodiments, the client agent 120operates in user-mode 203 but interfaces via the interceptor 350 to akernel-mode driver, process, service, task or portion of the operatingsystem, such as to obtain a kernel-level data structure 225. In furtherembodiments, the interceptor 350 is a user-mode application or program,such as application.

In one embodiment, the interceptor 350 intercepts or receives anytransport layer connection requests. In these embodiments, theinterceptor 350 executes transport layer application programminginterface (API) calls to set the destination information, such asdestination IP address and/or port to a desired location for thelocation. In this manner, the interceptor 350 intercepts and redirectsthe transport layer connection to an IP address and port controlled ormanaged by the interceptor 350 or client agent 120. In one embodiment,the interceptor 350 sets the destination information for the connectionto a local IP address and port of the client 102 on which the clientagent 120 is listening. For example, the client agent 120 may comprise aproxy service listening on a local IP address and port for redirectedtransport layer communications. In some embodiments, the client agent120 then communicates the redirected transport layer communication tothe appliance 200.

In some embodiments, the interceptor 350 intercepts a Domain NameService (DNS) request. In one embodiment, the client agent 120 and/orinterceptor 350 resolves the DNS request. In another embodiment, theinterceptor transmits the intercepted DNS request to the appliance 200for DNS resolution. In one embodiment, the appliance 200 resolves theDNS request and communicates the DNS response to the client agent 120.In some embodiments, the appliance 200 resolves the DNS request viaanother appliance 200′ or a DNS server 106.

In yet another embodiment, the client agent 120 may include two agents120 and 120′. In one embodiment, a first agent 120 may include aninterceptor 350 operating at the network layer of the network stack 267.In some embodiments, the first agent 120 intercepts network layerrequests such as Internet Control Message Protocol (ICMP) requests(e.g., ping and traceroute). In other embodiments, the second agent 120′may operate at the transport layer and intercept transport layercommunications. In some embodiments, the first agent 120 interceptscommunications at one layer of the network stack 210 and interfaces withor communicates the intercepted communication to the second agent 120′.

The client agent 120 and/or interceptor 350 may operate at or interfacewith a protocol layer in a manner transparent to any other protocollayer of the network stack 267. For example, in one embodiment, theinterceptor 350 operates or interfaces with the transport layer of thenetwork stack 267 transparently to any protocol layer below thetransport layer, such as the network layer, and any protocol layer abovethe transport layer, such as the session, presentation or applicationlayer protocols. This allows the other protocol layers of the networkstack 267 to operate as desired and without modification for using theinterceptor 350. As such, the client agent 120 and/or interceptor 350interfaces with or operates at the level of the transport layer tosecure, optimize, accelerate, route or load-balance any communicationsprovided via any protocol carried by the transport layer, such as anyapplication layer protocol over TCP/IP.

Furthermore, the client agent 120 and/or interceptor 350 may operate ator interface with the network stack 267 in a manner transparent to anyapplication, a user of the client 102, the client 102 and/or any othercomputing device 100, such as a server or appliance 200, 206, incommunications with the client 102. The client agent 120, or any portionthereof, may be installed and/or executed on the client 102 in a mannerwithout modification of an application. In one embodiment, the clientagent 120, or any portion thereof, is installed and/or executed in amanner transparent to any network configuration of the client 102,appliance 200, 205 or server 106. In some embodiments, the client agent120, or any portion thereof, is installed and/or executed withmodification to any network configuration of the client 102, appliance200, 205 or server 106. In one embodiment, the user of the client 102 ora computing device in communications with the client 102 are not awareof the existence, execution or operation of the client agent 12, or anyportion thereof. As such, in some embodiments, the client agent 120and/or interceptor 350 is installed, executed, and/or operatedtransparently to an application, user of the client 102, the client 102,another computing device, such as a server or appliance 200, 2005, orany of the protocol layers above and/or below the protocol layerinterfaced to by the interceptor 350.

The client agent 120 includes a streaming client 306, a collection agent304, SSL VPN agent 308, a network optimization engine 250, and/oracceleration program 302. In one embodiment, the client agent 120 is anIndependent Computing Architecture (ICA) client, or any portion thereof,developed by Citrix Systems, Inc. of Fort Lauderdale, Fla., and is alsoreferred to as an ICA client. In some embodiments, the client agent 120has an application streaming client 306 for streaming an applicationfrom a server 106 to a client 102. In another embodiment, the clientagent 120 includes a collection agent 304 for performing end-pointdetection/scanning and collecting end-point information for theappliance 200 and/or server 106. In some embodiments, the client agent120 has one or more network accelerating or optimizing programs oragents, such as a network optimization engine 250 and an accelerationprogram 302. In one embodiment, the acceleration program 302 acceleratescommunications between client 102 and server 106 via appliance 205′. Insome embodiments, the network optimization engine 250 provides WANoptimization techniques as discussed herein.

The streaming client 306 is an application, program, process, service,task or set of executable instructions for receiving and executing astreamed application from a server 106. A server 106 may stream one ormore application data files to the streaming client 306 for playing,executing or otherwise causing to be executed the application on theclient 102. In some embodiments, the server 106 transmits a set ofcompressed or packaged application data files to the streaming client306. In some embodiments, the plurality of application files arecompressed and stored on a file server within an archive file such as aCAB, ZIP, SIT, TAR, JAR or other archives. In one embodiment, the server106 decompresses, unpackages or unarchives the application files andtransmits the files to the client 102. In another embodiment, the client102 decompresses, unpackages or unarchives the application files. Thestreaming client 306 dynamically installs the application, or portionthereof, and executes the application. In one embodiment, the streamingclient 306 may be an executable program. In some embodiments, thestreaming client 306 may be able to launch another executable program.

The collection agent 304 is an application, program, process, service,task or set of executable instructions for identifying, obtaining and/orcollecting information about the client 102. In some embodiments, theappliance 200 transmits the collection agent 304 to the client 102 orclient agent 120. The collection agent 304 may be configured accordingto one or more policies of the policy engine 236 of the appliance. Inother embodiments, the collection agent 304 transmits collectedinformation on the client 102 to the appliance 200. In one embodiment,the policy engine 236 of the appliance 200 uses the collectedinformation to determine and provide access, authentication andauthorization control of the client's connection to a network 104.

In one embodiment, the collection agent 304 is an end-point detectionand scanning program, which identifies and determines one or moreattributes or characteristics of the client. For example, the collectionagent 304 may identify and determine any one or more of the followingclient-side attributes: 1) the operating system an/or a version of anoperating system, 2) a service pack of the operating system, 3) arunning service, 4) a running process, and 5) a file. The collectionagent 304 may also identify and determine the presence or version of anyone or more of the following on the client: 1) antivirus software, 2)personal firewall software, 3) anti-spam software, and 4) internetsecurity software. The policy engine 236 may have one or more policiesbased on any one or more of the attributes or characteristics of theclient or client-side attributes.

The SSL VPN agent 308 is an application, program, process, service, taskor set of executable instructions for establishing a Secure Socket Layer(SSL) virtual private network (VPN) connection from a first network 104to a second network 104′, 104″, or a SSL VPN connection from a client102 to a server 106. In one embodiment, the SSL VPN agent 308establishes a SSL VPN connection from a public network 104 to a privatenetwork 104′ or 104″. In some embodiments, the SSL VPN agent 308 worksin conjunction with appliance 205 to provide the SSL VPN connection. Inone embodiment, the SSL VPN agent 308 establishes a first transportlayer connection with appliance 205. In some embodiment, the appliance205 establishes a second transport layer connection with a server 106.In another embodiment, the SSL VPN agent 308 establishes a firsttransport layer connection with an application on the client, and asecond transport layer connection with the appliance 205. In otherembodiments, the SSL VPN agent 308 works in conjunction with WANoptimization appliance 200 to provide SSL VPN connectivity.

In some embodiments, the acceleration program 302 is a client-sideacceleration program for performing one or more acceleration techniquesto accelerate, enhance or otherwise improve a client's communicationswith and/or access to a server 106, such as accessing an applicationprovided by a server 106. The logic, functions, and/or operations of theexecutable instructions of the acceleration program 302 may perform oneor more of the following acceleration techniques: 1) multi-protocolcompression, 2) transport control protocol pooling, 3) transport controlprotocol multiplexing, 4) transport control protocol buffering, and 5)caching via a cache manager. Additionally, the acceleration program 302may perform encryption and/or decryption of any communications receivedand/or transmitted by the client 102. In some embodiments, theacceleration program 302 performs one or more of the accelerationtechniques in an integrated manner or fashion. Additionally, theacceleration program 302 can perform compression on any of theprotocols, or multiple-protocols, carried as a payload of a networkpacket of the transport layer protocol.

In one embodiment, the acceleration program 302 is designed, constructedor configured to work with appliance 205 to provide LAN sideacceleration or to provide acceleration techniques provided viaappliance 205. For example, in one embodiment of a NetScaler appliance205 manufactured by Citrix Systems, Inc., the acceleration program 302includes a NetScaler client. In some embodiments, the accelerationprogram 302 provides NetScaler acceleration techniques stand-alone in aremote device, such as in a branch office. In other embodiments, theacceleration program 302 works in conjunction with one or more NetScalerappliances 205. In one embodiment, the acceleration program 302 providesLAN-side or LAN based acceleration or optimization of network traffic.

In some embodiments, the network optimization engine 250 may bedesigned, constructed or configured to work with WAN optimizationappliance 200. In other embodiments, network optimization engine 250 maybe designed, constructed or configured to provide the WAN optimizationtechniques of appliance 200, with or without an appliance 200. Forexample, in one embodiment of a WANScaler appliance 200 manufactured byCitrix Systems, Inc. the network optimization engine 250 includes theWANscaler client. In some embodiments, the network optimization engine250 provides WANScaler acceleration techniques stand-alone in a remotelocation, such as a branch office. In other embodiments, the networkoptimization engine 250 works in conjunction with one or more WANScalerappliances 200.

In another embodiment, the network optimization engine 250 includes theacceleration program 302, or the function, operations and logic of theacceleration program 302. In some embodiments, the acceleration program302 includes the network optimization engine 250 or the function,operations and logic of the network optimization engine 250. In yetanother embodiment, the network optimization engine 250 is provided orinstalled as a separate program or set of executable instructions fromthe acceleration program 302. In other embodiments, the networkoptimization engine 250 and acceleration program 302 are included in thesame program or same set of executable instructions.

In some embodiments and still referring to FIG. 3, a first program 322may be used to install and/or execute the client agent 120, or anyportion thereof, automatically, silently, transparently, or otherwise.In one embodiment, the first program 322 is a plugin component, such anActiveX control or Java control or script that is loaded into andexecuted by an application. For example, the first program comprises anActiveX control loaded and run by a web browser application, such as inthe memory space or context of the application. In another embodiment,the first program 322 comprises a set of executable instructions loadedinto and run by the application, such as a browser. In one embodiment,the first program 322 is designed and constructed program to install theclient agent 120. In some embodiments, the first program 322 obtains,downloads, or receives the client agent 120 via the network from anothercomputing device. In another embodiment, the first program 322 is aninstaller program or a plug and play manager for installing programs,such as network drivers and the client agent 120, or any portionthereof, on the operating system of the client 102.

In some embodiments, each or any of the portions of the client agent120—a streaming client 306, a collection agent 304, SSL VPN agent 308, anetwork optimization engine 250, acceleration program 302, andinterceptor 350—may be installed, executed, configured or operated as aseparate application, program, process, service, task or set ofexecutable instructions. In other embodiments, each or any of theportions of the client agent 120 may be installed, executed, configuredor operated together as a single client agent 120.

D. Systems and Methods for Handling Network Congestion

Now referring to FIG. 4, a sample TCP packet is shown. In briefoverview, a TCP packet comprises a header 410 and payload 490. Theheader 410 comprises a number of indications which may be used toindicate transmission events related to data communications and networkcongestion, including an ACK number 460, Explicit CongestionNotification Echo (ECE flag), ACK flag 440, and Push (PSH) flag 420.

Still referring to FIG. 4, the sample TCP packet is shown to graphicallyillustrate some of the information that may be included in a TCP packet.Although the sample shown reflects a particular embodiment of a TCPpacket, persons of ordinary skill in the art will recognize that manyimplementations and variations of TCP and other network protocols may beapplicable to the systems and methods described herein, including theTCP implementations specified in RFC 793, RFC 1122, and specifically RFC2581 and RFC 3168 relating to congestion control and avoidance. In someof these implementations and others, an ECE flag may be utilized tonotify the packet recipient that network congestion is occurring. Thepacket recipient may then elect to slow down their rate of transmissionor adopt any other congestion control or avoidance tactics. This ECEflag may also be used in combination with other signaling bits whichnegotiate with a recipient whether Explicit Congestion Notification(ECN) is supported. Any bits in any protocol used in the negotiation orsignaling of explicit congestion may be referred to as ECN bits.

Now referring to FIG. 5, a system for distributing congestion events bya device among a plurality of transport layer connections is shown. Inbrief overview, a number of clients 102 a, 102 b, 102 n communicate witha number of servers 106 a, 106 b, 106 n via an appliance 200. When theappliance receives an indication of network congestion 500 a, a flowcontroller operating within the appliance may intercept the indication500 a, and transmit a second congestion indication 500 b via a differentconnection. In this way, an appliance may allocate congestionindications among connections to control the bandwidth used by eachconnection. In some embodiments, the allocation of congestionindications may be used to aid in providing quality of service (QoS)guarantees with respect to one or more connections.

Still referring to FIG. 5, now in greater detail, a number of clients102 communicate with a number of servers 106 via an appliance 200. Theclients 102 may be connected to the appliance 200 by any means includinga LAN, WAN, MAN, or any other network or combination of networks. Insome cases, the clients 102 may each be connected to the appliance 200via one or more other appliances. For example, the clients 102 may eachreside at a branch office, while the appliance 200 and servers 106 arelocated at a central office. The clients 106 may be connected to theappliance 200 via a second appliance 200′ located at the branch office.Although the figure depicts a plurality of clients, the systems andmethods described may also be applied to cases in which a single client102 is communicating over a plurality of connections to one or moreservers.

The servers 106 may be connected to the appliance 200 by any meansincluding a LAN, WAN, MAN, or any other network or combination ofnetworks. The system and methods described may also be applied to casesin which a single server 106 is communicating over a plurality ofconnections to one or more clients.

In some embodiments, the appliance 200 may be serving as a proxy for theconnections 510, 515, 520. In other embodiments, the appliance 200 maybe serving as a transparent proxy for the connections. The appliance 200may be providing caching, acceleration or any other network serviceswith respect to the connections.

The appliance 200 receives a congestion indication 500 a via aconnection 515 a. A congestion indication may comprise any notificationwhich explicitly communicates network congestion or allows an inferenceof potential network congestion to be drawn. Congestion indications 500may comprise, without limitation, indications of dropped packets,indications of delayed packets, indications of corrupted packets, andexplicit congestion indications. Specific examples of congestionindications 500 may include, without limitation, TCP packets comprisingduplicate acknowledgements (ACKs) and TCP packets comprising one or moremarked ECN bits. Congestion indications 500 may also be referred to asindications of congestion events. A congestion event may be any networkor device event which is possibly caused by network congestion.

The appliance 200 may then generate a congestion indication 500 b to betransmitted via a connection other than a connection corresponding tothe connection that the congestion indication 500 a was received on. Theappliance may generate the congestion indication via any means, and maygenerate and transmit any type of congestion indication. In someembodiments, the appliance 200 may generate the congestion indication500 b in a transparent manner such that it appears to the server 106 athat the congestion indication originated from client 102 a.

Referring now to FIG. 6, one embodiment of a method for distributingcongestion events by a device among a plurality of transport layerconnections is shown. In brief overview, the method comprisesestablishing, by a device, a plurality of transport layer connections,one or more of the transport layer connections having an assignedpriority (step 601). The device receives, via a first transport layerconnection, a first indication of network congestion (step 603). Thedevice then selects, according to the assigned priorities, a secondtransport layer connection (step 605), and transmits a second indicationof a congestion event via the selected second transport layer connection(step 609). In some embodiments, the method may further compriseselecting a third transport layer connection according to the assignedpriorities (step 611) and transmitting, via the third transport layerconnection, a third congestion indication (step 613).

Still referring to FIG. 6, now in greater detail, it may be desirable insome network environments to have a means for allocating congestionevents. If a network 104 becomes congested, it may not be desirable thatall of the connections communicating via the network 104 are equallyimpacted by the congestion. A slowdown in a connection transmittingreal-time videoconferencing data may result in severe consequences forthe recipients of the connection as video quality and response timesuffers. By contrast, a large file transfer might be able to absorbsignificant congestion delays without severe negative consequences for auser. However, if a number of connections are operating over the samenetwork 104, there may be no guarantee that the first connection tosuffer a congestion event such as a dropped packet will be the lowestpriority connection. In these cases, it may be advantageous for anappliance to redistribute congestion events such that lower priorityconnections receive congestion events and throttle back their bandwidthaccordingly, while allowing higher priority connections to continuetransmitting at higher rates. In other cases, redistributing congestionevents may be used to ensure that a number of connections continue totransmit at an equal rate, even where congestion events do not occurevenly across all the connections. In still other embodiments, a devicemay distribute congestion events based on transaction size

In the method shown, a device may establish a plurality of transportlayer connections, one or more of the connections having an assignedpriority (step 601). A device may establish the plurality of connectionswith one or more computing devices, which may include clients 102,servers 106, and other appliances 200. In some embodiments, the devicemay establish the transport layer connections in the process of servingas an intermediary for the transport layer connections. In theseembodiments, two or more of the plurality of transport layer connectionsmay comprise corresponding transport layer connections similar toconnections 510 a and 510 b in FIG. 5. The device may comprise anappliance 200, client agent, or server agent. In one embodiment, thetransport layer connections may comprise TCP connections. In otherembodiments, the transport layer connections may comprise any otherprotocol. In one embodiment, the device may treat a sequence of packetswith the same source and destination as a single connection, even if thepackets are not sent using a protocol which explicitly uses connections.

The device may assign priorities to one or more of the establishedconnections in any manner. In some embodiments, a device may assign aunique priority to each of the plurality of connections. In otherembodiments, the device may assign a single priority to some or all ofthe plurality of connections. In some embodiments, the device may assigna priority to a connection at the time the connection is establish. Inother embodiments, the device may assign a priority to a connection onlyafter a congestion event or other event has occurred. In someembodiments, the priority assigned to a given connection may remainconstant. In other embodiments, the priority assigned to a givenconnection may change over time in response to the properties of theconnection, and conditions within the device or a network. For example,a device may assign a higher priority to connections with relatively lowcurrent bandwidth usage, and a lower priority to connections using morecurrent bandwidth.

In one embodiment, the device may assign priorities based on a protocolor protocols of a connection. For example, a device may assign higherpriorities to UDP traffic as opposed to TCP traffic. Or for example, adevice may assign a higher priority to HTTP traffic as opposed to FTPtraffic. In another embodiment, the device may assign priorities basedon one or more properties of the traffic carried via the connections.For example, an appliance may assign higher priorities to burstyconnections than to connections featuring relatively constant bandwidth.In some embodiments, priorities may be explicitly configured, either byan administrator of the device, or by messages contained in theconnections themselves.

In some embodiments, an assigned priority may directly correlate to anassigned bandwidth of a connection. For example, an appliance may assigna maximum bandwidth of 10 Mb/sec to each of the plurality ofconnections. Or, an appliance may assign a target bandwidth of 5 Mb/secto one of the plurality of connections, while assigning a targetbandwidth of 10 Mb/sec to a second one of the plurality of connections.

In other embodiments, the assigned priority may correspond to a qualityof service level for the connection. A quality of service level may bespecified in any manner. In some embodiments, the appliance mayrecognize and/or utilize any quality of service indications used inTCP-related or IP-related protocols in a connection. For example, RFC1349, RFC 2474, and RFC 2475 detail methods by which TCP and IPconnections can signal quality and type of service related information.

In still other embodiments, the assigned priority may correspond to acurrent or average transaction size of the connection. In theseembodiments, the device may assign higher priorities to connectionscarrying shorter transactions. These connections may be more likely tobe carrying time-sensitive traffic such as VoIP or remote procedurecalls which will be more adversely affected by congestion events.

The device may receive, via a first transport layer connection, a firstindication of network congestion in any manner (step 603). Theindication of network congestion may comprise any congestion indication500 as described herein. In some embodiments, the device may receive aplurality of congestion indications. In these embodiments, the pluralityof congestion indications may be received via one or more of theplurality of connections.

The device may then select, according to the assigned priorities, asecond transport layer connection of the plurality of connections (step605). In some embodiments, the device may select the transport layerconnection having the lowest assigned priority. In other embodiments,the device may select the connection with the lowest assigned prioritythat is also transmitting data over the same network over which thecongestion event was received. In this embodiment, the appliance mayselect a connection which is indirectly transmitting data over the samenetwork over which the congestion event was received. For example, inFIG. 5, the appliance selected connection 510 b, even though 510 b maynot directly communicate over the network used by connection 515 b.However, data sent over connection 510 b is then sent across connection510 a, which may uses the same network as connection 515 a, and thusselecting connection 510 b may produce the desired result of reducingtraffic over network 104 a.

In one embodiment, the device may select a connection with a lowestassigned priority relative to current bandwidth usage (step 605). Inthis embodiment, the goal may be to identify a low priority connectionwhich is consuming a large amount of bandwidth, and is perhaps a partialcause of a received congestion event. For example, the device may selecta connection with a priority below a given threshold but transmitting inexcess of a second given threshold. In this example, a device may selecta connection with a priority below a threshold of critical which istransmitting in excess of a threshold of 2 Mb/sec. Or the device mayselect the lowest priority connection which is transmitting in excess ofa given bandwidth threshold. In still another embodiment, the device mayselect a connection using the greatest amount of bandwidth.

In some embodiments, the device may select a connection which istransmitting the most in excess of an assigned bandwidth. For example,if three connections are each allocated 4 Mb/sec and a congestion eventis received via a first of the connections, the device may select theconnection which is transmitting most in excess of the 4 Mb/secthreshold to transmit a congestion indication. The device may select theconnection which is transmitting most in excess either in absolute termsof bits per second or in percentage terms. For example, if threeconnections are assigned bandwidths of 1 Mb/sec, 2 Mb/sec, and 10Mb/sec, the device may select the connection exceeding its assignedbandwidth by the highest percentage.

In some embodiments, the device may also consider whether a connectionhas received another recent congestion indication in the selecting of aconnection to receive a subsequent congestion indication. In one ofthese embodiments, an appliance may remove from consideration anyconnections which have received a congestion indication within the lastround-trip time (RTT), either generated by the device or from anothersource. In this embodiment, the device may select the connectiontransmitting most in excess of its assigned bandwidth that has notreceived a congestion indication within the last RTT. In someembodiments, a device may maintain a list, queue, or other datastructure to record the congestion indications received and allocatedamong the connections. In some of these embodiments, a device mayutilize a round-robin or other algorithm to distribute congestionindications among the connections.

After selecting a connection (step 605), the device may transmit, viathe selected connection, an indication of network congestion in anymanner. In some embodiments, the device may transmit an indication thata packet has been dropped. In other embodiments, the device may transmita packet or packets with marked ECN bits.

The device may squelch, drop, ignore, rewrite, or otherwise handle thereceived congestion indication in order to conceal the indication fromthe intended recipient. For example, if the received congestionindication was a packet with marked ECN bits, the device may unmark theECN bits before forwarding the packet to the recipient. Or for example,if the received congestion indication was an indication of a droppedpacket, the device may retransmit the dropped packet without notifyingthe original sender of the packet.

In some embodiments, the device may, in response to a single receivedcongestion indication, transmit multiple congestion indications. Inthese embodiments, the device may select a third connection to receive acongestion event, using any of the criteria used to select the secondconnection. For example, if a congestion indication is received via ahigh priority connection, the device may transmit congestion indicationsout via two lower priority connections to create a reduction insubsequent bandwidth usage of the lower priority connections sufficientto alleviate the network congestion. This example may be appropriate incases where the two lower priority connections are transmitting at lowerrates relative to the higher priority connection.

Referring now to FIG. 7, a system for providing quality of servicelevels to transport connections using a transparent proxy to controlconnection bandwidth is shown. In some ways, the system is similar tothe system of FIG. 5, in that an appliance uses congestion indicationsto control bandwidth usage among a plurality of connections. However, inFIG. 7, the appliance does not necessarily wait for an incomingcongestion indication to arrive before sending out a congestion event.Rather, the appliance may transmit a congestion indication as soon asthe appliance detects that a connection is exceeding an assignedbandwidth.

Still referring to FIG. 7, now in greater detail, a number of clients102 communicate with a number of servers 106 via an appliance 200. Theclients 102 may be connected to the appliance 200 by any means includinga LAN, WAN, MAN, or any other network or combination of networks. Insome cases, the clients 102 may each be connected to the appliance 200via one or more other appliances. For example, the clients 102 may eachreside at a branch office, while the appliance 200 and servers 106 arelocated at a central office. In another example, the appliance 200 maybe located at the branch office with the clients. The clients 106 may beconnected to the appliance 200 via a second appliance 200′ located atthe branch office. Although the figure depicts a plurality of clients,the systems and methods described may also be applied to cases in whicha single client 102 is communicating over a plurality of connections toone or more servers.

The servers 106 may be connected to the appliance 200 by any meansincluding a LAN, WAN, MAN, or any other network or combination ofnetworks. The system and methods described may also be applied to casesin which a single server 106 is communicating over a plurality ofconnections to one or more clients.

In some embodiments, the appliance 200 may be serving as a proxy for theconnections 510, 520. In other embodiments, the appliance 200 may beserving as a transparent proxy for the connections. The appliance 200may be providing caching, acceleration or any other network serviceswith respect to the connections. In one embodiment, the connections maycomprise TCP connections. In other embodiments, the connections maycomprise any other transport layer protocol.

In the system shown, the appliance comprises a flow controller whichdetermines when a connection is exceeding an assigned bandwidth. Theflow controller then induces a congestion event in the connection in thehopes of causing a sender of the connection to reduce their bandwidth.This process will be described in greater detail with respect to FIG. 8.

Referring now to FIG. 8, a method for providing quality of servicelevels to transport connections using a transparent proxy to controlconnection bandwidth is shown. In brief overview, the method comprisesdetermining, by an appliance serving as a transparent proxy for atransport layer connection between a sender and a receiver, that therate of transmission of the sender via the transport layer connectiondiffers from a predetermined rate of transmission (step 801). Theappliance may then generate, in response to the determination, anacknowledgement packet containing an indication to alter the rate oftransmission (step 803), and transmit the generated acknowledgement(step 805).

Still referring to FIG. 8, now in greater detail, an appliance servingas a transparent proxy for a transport layer connection between a senderand a receiver may determine that the rate of transmission of the sendervia the transport layer connection differs from a predetermined rate oftransmission (step 801) in any manner. The rate of transmission may bemeasured using any metric, and over any time interval. In oneembodiment, an appliance may determine that a connection has exceeded amaximum number of allowable bytes to be transmitted over a given timeinterval. A time interval may comprise any duration, including withoutlimitation 1 seconds, 0.5 seconds, 1 second, 2 seconds, 3 seconds, 5seconds, and 10 seconds. In one embodiment, an appliance may determinethat a connection is below a maximum number of allowable bytes to betransmitted over a given time interval.

In some embodiments, a plurality of connections may each be assigned anidentical predetermined rate of transmission. In other embodiments,different connections may be assigned different predetermined rates oftransmission. Connections may be assigned rates of transmission in anymanner, including without limitation based on priority, past bandwidthconsumption, protocol, source address, destination address, andconnection burstiness. In some embodiments, a plurality of connectionsmay be assigned a relative portion of a total known available bandwidth.For example, if the appliance is serving as a transparent proxy for anumber of connections over a WAN with a known or approximately knowncapacity, each connection traveling over the WAN may be allocated aportion of the total capacity. In this example, if four connections aretraveling over a WAN with a known bandwidth of 10 Mb/sec., eachconnection may be assigned a predetermined rate of transmission of 2.5Mb/sec. Alternatively, one priority connection might be assigned a rateof 6 Mb/sec, while the three other connections are assigned rates of 2Mb/second. In this example and others, the predetermined rate oftransmission may be altered as new connections are created or existingconnections are stopped.

In some embodiments, the predetermined rate of transmission maycorrespond to a quality of service level for the connection. A qualityof service level may be specified in any manner. In some embodiments,the appliance may recognize and/or utilize any of the quality of serviceindications used in TCP-related or IP-related protocols. In otherembodiments, the predetermined rate of transmission may correspond to adetermination that a given connection is transmitting over a WAN or aLAN.

In still other embodiments, the appliance may assign a priority to eachof a number of connections, and then assign predetermined rates oftransmission based on the assigned priorities. The priorities may beassigned using any manner, including those described above with respectto FIGS. 5 and 6.

The appliance may generate, in response to the determination of step801, an acknowledgement packet comprising an indication to alter therate of transmission. The appliance may generate the acknowledgementpacket in any manner. In some embodiments, the appliance may generatethe acknowledgement packet immediately after the determination. In otherembodiments, the appliance may wait a predetermined time interval beforegenerating the acknowledgement. The appliance may generate thisacknowledgement even if there is no acknowledgement from the receiver ofthe connection. The appliance may use any technique to generate anacknowledgement that is transparent to the sender and receiver of theconnection, including matching a source address, destination address,sequence number, and/or acknowledgement number.

In some embodiments, the acknowledgement packet may contain anyindication to reduce the sender's rate of transmission. In oneembodiment, an indication to reduce transmission rate may comprise anacknowledgement containing an indication that a packet was lost. Inanother embodiment, an indication to reduce transmission rate maycomprise an acknowledgement comprising marked ECN bits. In still anotherembodiment, an indication to reduce transmission rate may comprise anacknowledgement with an indication for the sender to reduce a windowsize for the connection. In this embodiment, the reduced window size maybe different than a window size advertised by a receiver of theconnection.

In other embodiments, the acknowledgement packet may contain anyindication to increase the sender's rate of transmission. In oneembodiment, this indication to increase the rate of transmission maycomprise an acknowledgement with an indication for the sender toincrease a window size for the connection. In this embodiment, theincreased window size may be different than a window size advertised bya receiver of the connection.

In some embodiments, an appliance may transmit multiple indications inresponse to a single determination. For example, if a connection issignificantly exceeding an allotted bandwidth, the appliance maygenerate and transmit an acknowledgment comprising both an indication ofa dropped packet and an indication to decrease window to the sender. Insome embodiments, an appliance may transmit indications to bothendpoints of a connection. This may be appropriate in cases where bothparties of a connection are transmitting relatively equal amounts.

In all of the above embodiments, an appliance may continue to transmitacknowledgements containing indications to alter transmission ratesuntil a connection begins transmitting within the predetermined rate oftransmission. For example, an appliance may continue to transmit, to asender, indications to reduce window size until the indications have thedesired effect of the sender sufficiently reducing their rate oftransmission.

Referring now to FIG. 9A, a system for dynamically controlling bandwidthby a sender of a plurality of transport layer connections according topriorities of the connections is illustrated. In brief overview, aclient 102 sends data via a client agent 120 to a number of servers 106.When the client agent 120 receives an indication of a congestion eventvia one of the connections, a flow controller 220 reduces a congestionwindow of the connection in accordance with a priority assigned to theconnection. In this manner, higher priority connections may be made lesssensitive to congestion events, while lower priority connections may bemade to respond more rapidly to congestion events. Although the systemshown depicts a flow controller 220 on a client agent 120, in otherembodiments, the flow controller 220 may reside on an appliance 200,server 106, or server agent.

Still referring to FIG. 9A, now in greater detail, a number ofprotocols, such as TCP for example, provide mechanisms for reducingtransmission of data upon detection of potential network congestion.With respect to TCP, these mechanisms may include modifications to thecongestion window, which dictates the maximum allowed amount oftransmitted unacknowledged data. For example, TCP Reno and FAST-TCP maydivided the congestion window in half each time an indication that apacket has been dropped is received. This may result in dramaticreductions in transmitted data upon receiving a packet loss indication.Other protocols may provide for other formulas to use to determine themaximum amount of unacknowledged data given a packet loss event.However, in many cases, it may be desirable to adjust the formula forresponding to congestion events based on the priority of the connection.For example, if a number of connections are transmitting over a linkwith fixed capacity, it may be desirable for higher priority connectionsto reduce their congestion windows more slowly than lower priorityconnections in response to congestion events. This may allow the higherpriority connections to continue transmitting at a relatively higherrate, while the bulk of the bandwidth reductions is absorbed by thelower priority connections. This may also allow connections which maybenefit from a relatively stable bandwidth, such as real-timeapplications, to avoid unwanted spikes in performance caused by rapiddecreases in congestion windows.

Now referring to FIG. 9B, a method for dynamically controllingconnection bandwidth by a sender of one or more transport layerconnections according to a priority assigned to one or more of theconnections is shown. In brief overview, the method comprises: a sendertransmitting data via a first transport layer connection, the connectionhaving a first congestion window size identifying an amount of data tobe transmitted in the absence of an acknowledgement from a receiver(step 901). The sender may receive an indication of a packet loss viathe connection (step 903), and identify a reduction factor correspondingto the connection (step 905). The sender may then determine a secondcongestion window size, the second congestion window size comprising thefirst congestion window size reduced by the reduction factor (step 907).The sender may then transmit data according to the second congestionwindow size (step 909). The sender may comprise any computing deviceand/or software, including without limitation a client, server, clientagent, server agent, and appliance.

Still referring to FIG. 9B, now in greater detail, a device transmitsdata via a transport layer connection having a first congestion windowsize (step 901). A congestion window size may comprise any cap,limitation, or other restriction on the amount of unacknowledged data“in flight.” For example, a sender may stop transmitting new data oncethe amount of unacknowledged data equals or exceeds the congestionwindow size. In one embodiment, the first congestion window size may bea TCP congestion window size. In some embodiments, a device may betransmitting data via a plurality of connections, each connection havinga congestion window size.

The sender may then receive an indication of a packet loss via the firstconnection (step 903). The sender may receive this indication via anyprotocol or protocols. In some embodiments, a packet loss indication maycomprise one or more duplicate acknowledgements in a TCP connection. Inother embodiments, a packet loss indication may comprise a timeout, orany other indication indicating some likelihood that a packettransmitted by the sender was not received. In still other embodiments,the sender may receive an indication of congestion as described above.

The sender may identify a reduction factor corresponding to a priorityof the transport layer connection (step 905) in any manner. The sendermay assign a priority to the transport layer connection using anymethod, including any method described herein. In some embodiments,higher priority connections may be identified with lower reductionfactors relative to lower priority connections. A reduction factor maycomprise any number used to reduce a congestion window size. Forexample, in many TCP implementations, the standard reduction factor maybe 2, specifying that the congestion window is divided by two for eachloss event that occurs. With respect to the method shown, a reductionfactor may be any number. In one embodiment, a reduction factor maybe 1. In this embodiment, the congestion window size may not be reducedat all if a congestion event occurs. In other examples, reductionfactors may comprise 1.1, 1.2, 1.3, 1.4, 1.5, 1.6, 1.7, 1.8, 1.9, or 2or any numbers within that range. In some embodiments, reduction factorsof less than 2 may be used with respect to higher priority connections.In still other embodiments, reduction factors may comprise 2.1, 2.5, 3,3.5, 4, 4.5, 5, 5.5, or 6, or any numbers within that range. In someembodiments, reduction factors of greater than 2 may be used withrespect to lower priority connections.

The sender then determines a second congestion window size, the secondcongestion window size comprising the first congestion window sizereduced by the reduction factor (step 907). The sender may reduce thecongestion window size by the reduction factor in any manner. In someembodiments, the sender may divide the first congestion window size bythe reduction factor. In other embodiments, the sender may subtract thereduction factor from the first congestion window size. In still otherembodiments, the sender may subtract a constant multiplied by thereduction factor from the congestion window size. For example, sendermay subtract the maximum segment size multiplied by the reduction factorfrom the congestion window size. It should be recognized at this pointthat a reduction factor may be incorporated into any method of alteringcongestion window size in response to loss events, including any of thevariants of TCP.

To give a detailed example, in one embodiment, the sender may divide thefirst congestion window size by the reduction factor to determine thenew congestion window size. In this example, the sender may assign areduction factor of 4 to low priority connections, a reduction factor of2 to normal priority connections, and a reduction factor of 1.33 to highpriority connections.

The sender may then transmit, via the connection, data according to thesecond congestion window size. In some embodiments, the sender maycontinue to use the method shown, such that the congestion window iscontinually altered as new indications of packet losses are received.

Now referring to FIG. 9C, a second method for dynamically controllingconnection bandwidth by a sender of one or more transport layerconnections according to a priority assigned to one or more of theconnections is shown. Broadly speaking, this method applies the conceptsof the systems and methods of FIGS. 9A and 9B to situations in which thecongestion window should be increased, rather than decreased. In briefoverview, the method comprises: a sender transmitting data via a firsttransport layer connection, the connection having a first congestionwindow size identifying an amount of data to be transmitted in theabsence of an acknowledgement from a receiver (step 901). The sender maythen receive no indications of a packet loss during a given timeinterval (step 903), and identify an enlargement factor corresponding tothe connection (step 905). The sender may then compute a secondcongestion window size, the second congestion window size computed withrespect to the first congestion window size and the enlargement factor(step 907). The sender may then transmit data according to the secondcongestion window size (step 909). The sender may comprise any computingdevice and/or software, including without limitation a client, server,client agent, server agent, and appliance.

Still referring to FIG. 9C, now in greater detail, a device transmitsdata via a transport layer connection having a first congestion windowsize (step 931). In some embodiments, a device may be transmitting datavia a plurality of connections, each connection having a congestionwindow size. In one embodiment, the transport layer connection maycomprise a TCP connection.

The sender may then receive no indications of a packet loss via thefirst connection during a time interval (step 933). The time intervalmay comprise any time interval. In one embodiment, the time interval maycomprise a fixed amount of time, including without limitation 0.05seconds, 1 seconds, 0.2 seconds, 0.4 seconds, 0.5 seconds, 1 second, or2 seconds. In other embodiments, the time interval may correspond to aproperty of the connection. In one embodiment, the time interval maycorrespond to a round trip time of the connection. In anotherembodiment, the time interval may correspond to an average round triptime of the connection. In still other embodiments, the time intervalmay correspond to a multiple of a round trip time or average round triptime.

The sender may identify an enlargement factor corresponding to apriority of the transport layer connection (step 935) in any manner. Thesender may assign a priority to the transport layer connection using anymethod, including any method described herein. In some embodiments,higher priority connections may be identified with higher enlargementfactors relative to lower priority connections. An enlargement factormay comprise any number used to increase a congestion window size. Forexample, in some TCP implementations, the enlargement factor may be themaximum packet size for the connection, specifying that the congestionwindow is increased by the maximum packet size each time a time interval(the round trip time) passes without a loss event. In other TCPimplementations, the enlargement factor may include a minimum round triptime divided by the most recent round trip time. With respect to themethod shown, an enlargement factor may be any number. In oneembodiment, an enlargement factor may be 0. In this embodiment, thecongestion window size may not be increased at all if a congestion eventoccurs. In other examples, enlargement factors may comprise 0.1, 0.5,0.75, 0.9, 1, 1.1, 1.2, 1.3, 1.4, 1.5, 1.6, 1.7, 1.8, 1.9, or 2 or anynumbers within that range. In still other embodiments, reduction factormay comprise 2.1, 2.5, 3, 3.5, 4, 4.5, 5, 5.5, or 6, or any numberswithin that range. In some embodiments, enlargement factors of less than1 may be used with respect to lower priority connections. In someembodiments, enlargement factors of greater than 1 may be used withrespect to higher priority connections.

The sender then determines a second congestion window size, the secondcongestion window size computed with respect to the first congestionwindow size and the enlargement factor (step 937). The sender may usethe enlargement factor to compute the second congestion window size inany manner. In some embodiments, the sender may multiply the firstcongestion window size by the enlargement factor. In other embodiments,the sender may add the enlargement factor to the first congestion windowsize. In still other embodiments, the sender may add a constantmultiplied by the enlargement factor to the congestion window size. Forexample, the sender may add the maximum segment size multiplied by theenlargement factor to the congestion window size. In other embodiments,the sender may also incorporate one or more round trip time calculationsinto the computation. For example, the sender may set the secondcongestion window size equal to EF (MPS)+CWND_OLD*MIN_RTT/LAST_RTT,where EF is the enlargement factor, MSS is the maximum packet size,CWND_OLD is the previous congestion window size, and MIN_RTT andLAST_RTT are the minimum and last round trip times of the connection,respectively.

It should be recognized at this point that an enlargement factor may beincorporated into any method of altering congestion window size inresponse to loss events, including any of the variants of TCP. In someembodiments, the above method may be applied to alter the behavior ofTCP slow start methods. For example, the initial congestion windowsallocated to connections during the slow start phase may be determinedwith respect to the priorities of the connections. In this example, alow priority connection might start with an initial congestion window of1, while a high priority connection might start with a congestion windowof 4.

To give a detailed example, in one embodiment, the sender may add theenlargement factor multiplied by the maximum packet size to the previouscongestion window size. In this example, the sender may assign anenlargement factor of 0.5 to low priority connections, an enlargementfactor of 1 to normal priority connections, and an enlargement factor of2 to high priority connections.

The sender may then transmit, via the connection, data according to thesecond congestion window size. In some embodiments, the sender maycontinue to use the method shown, such that the congestion window iscontinually altered as new indications of packet losses are received.

In some embodiments, the methods described in FIGS. 8B and 8C may beused in conjunction on one or more connections. To give an example, aWAN optimization appliance serving as a transparent proxy to a number ofconnections may assign priorities to each of the connections andcorresponding enlargement and reduction factors. In this example, thepriorities and enlargement and reduction factors may be chosen withrespect to the latency of each of the connections. Since typical TCPconnections may take longer to speed up as latency increases, theappliance may counter this by assigning higher enlargement factors tohigher latency connections. Along these lines, the appliance may detectwhich of a number of connections are traveling over a WAN and increasethe enlargement factors of those connections accordingly. The appliancemay also assign smaller reduction factors to high latency connections,since they will be slower to recover from any sudden decrease incongestion window size. These smaller reduction factors may also reflectthe fact that with high latency connections it more be more likely thattransient congestion will have already passed by the time anyindications of the dropped packets arrive. The device may thus be ableto balance the respective bandwidths of connections having a variety oflatencies using the enlargement and reduction factors.

While the invention has been particularly shown and described withreference to specific preferred embodiments, it should be understood bythose skilled in the art that various changes in form and detail may bemade therein without departing from the spirit and scope of theinvention as defined by the appended claims.

1. A method for dynamically controlling connection bandwidth by a senderof one or more transport layer connections according to a priorityassigned to one or more of the transport layer connections, the methodcomprising: (a) transmitting, by a sender, data via a first transportlayer connection, wherein the first transport layer connection has afirst congestion window size identifying an amount of data to betransmitted by the sender in the absence of an acknowledgement from areceiver; (b) receiving, by the sender via the first transport layerconnection, an indication of a packet loss via the first transport layerconnection; (c) identifying a reduction factor, the reduction factorcorresponding to a priority assigned by the sender to the firsttransport layer connection; (d) determining a second congestion windowsize, the second congestion window size comprising the first congestionwindow size reduced by the reduction factor; and (e) transmitting, bythe sender via the first transport layer connection, data according tothe second congestion window size.
 2. The method of claim 1, whereinstep (a) comprises transmitting data via a first TCP connection, whereinthe first TCP connection has a congestion window corresponding to themaximum amount of unacknowledged data to be transmitted.
 3. The methodof claim 1, wherein step (d) comprises determining a second congestionwindow size, the second congestion window size comprising the firstcongestion window size divided by the reduction factor.
 4. The method ofclaim 3, wherein the reduction factor is greater than
 2. 5. The methodof claim 3, wherein the reduction factor is less than
 2. 6. The methodof claim 1, wherein the sender assigns higher priority connections lowerreduction factors relative to lower priority connections.
 7. The methodof claim 1, wherein step (a) further comprises: (a-a) transmitting datavia the first transport layer connection having a first assignedpriority; and (a-b) transmitting data via a second transport layerconnection having a second assigned priority.
 8. The method of claim 7,further comprising identifying a reduction factor for the firsttransport layer connection that is at least twice an identifiedreduction factor for the second transport layer connection.
 9. Themethod of claim 7, further comprising identifying a reduction factor forthe first transport layer connection that is at least three times anidentified reduction factor for the second transport layer connection.10. The method of claim 1, wherein step (a) comprises: (a-a)transmitting data via a first transport layer connection having a firstassigned priority; and (a-b) transmitting data via a second transportlayer connection having no assigned priority.
 11. The method of claim10, wherein step (c) comprises: (c-a) identifying a reduction factor of2 for the second transport layer connection; and (c-b) identifying areduction factor not equal to 2 for the first transport layerconnection.
 12. A system for dynamically controlling connectionbandwidth according to a priority assigned to one or more transportlayer connections by a network appliance serving as an intermediary forthe one or more transport layer connections, the system comprising: anetwork appliance which serves as an intermediary for a first transportlayer connection between a sender and a receiver, the network appliancecomprising: a packet processing engine which transmits data via thefirst transport layer connection, wherein the first transport layerconnection has a first congestion window size corresponding to themaximum amount of unacknowledged data to be transmitted; and receives,via the first transport layer connection, an indication of a packetloss; and a flow control module in communication with the packetprocessing engine which computes a reduction factor, the reductionfactor corresponding to a priority assigned by the appliance to thefirst transport layer connection; computes a second congestion windowsize, the second congestion window size comprising the first congestionwindow size divided by the reduction factor; and transmits, via thefirst transport layer connection, data according to the secondcongestion window size.
 13. The system of claim 12, wherein the packetprocessing engine transmits data via a first TCP connection, wherein thefirst TCP connection has a congestion window corresponding to themaximum amount of unacknowledged data to be transmitted.
 14. The systemof claim 12, wherein the determined reduction factor is greater than 2.15. The system of claim 12, wherein the predetermined reduction factoris less than
 2. 16. The system of claim 12, wherein the networkappliance assigns higher priority connections lower reduction factorsrelative to lower priority connections.
 17. The system of claim 12,wherein the packet processing engine transmits data via the firsttransport layer connection having a first assigned priority; and furthertransmits data via a second transport layer connection having a secondassigned priority.
 18. The system of claim 17, wherein the computedreduction factor of the first transport layer connection issubstantially twice a computed reduction factor corresponding to thesecond transport layer connection.
 19. The system of claim 17, whereinthe computed reduction factor of the first transport layer connection issubstantially three times a computed reduction factor corresponding tothe second transport layer connection.
 20. The system of claim 12,wherein the packet processing engine transmits, via the first transportlayer connection, an acknowledgement comprising the second congestionwindow size.
 21. The system of claim 12, wherein the packet processingengine transmits data via a first transport layer connection having afirst assigned priority; and transmits data via a second transport layerconnection having no assigned priority.
 22. The system of claim 21,wherein the reduction factor of the first transport layer connection isnot equal to 2, and the reduction factor of the second transport layerconnection is equal to
 2. 23. A computer-implemented system fordynamically controlling connection bandwidth by a sender of one or moretransport layer connections according to a priority assigned to one ormore of the transport layer connections, the system comprising: anetwork stack which transmits data via a first transport layerconnection, wherein the first transport layer connection has a firstcongestion window size corresponding to the maximum amount ofunacknowledged data to be transmitted; and receives, via the firsttransport layer connection, an indication of a packet loss; and a flowcontroller in communication with the network stack which computes areduction factor, the reduction factor corresponding to a priorityassigned by the flow controller to the first transport layer connection;computes a second congestion window size, the second congestion windowsize comprising the first congestion window size divided by thereduction factor; and transmits, via the first transport layerconnection, data according to the second congestion window size.
 24. Thesystem of claim 23, wherein the packet processing engine transmits datavia a first TCP connection, wherein the first TCP connection has acongestion window corresponding to the maximum amount of unacknowledgeddata to be transmitted.
 25. The system of claim 23, wherein thereduction factor is greater than
 2. 26. The system of claim 23, whereinthe reduction factor is less than
 2. 27. The system of claim 23, whereinthe flow controller assigns higher priority connections lower reductionfactors relative to lower priority connections.
 28. The system of claim23, wherein the network stack transmits data via the first transportlayer connection having a first assigned priority; and further transmitsdata via a second transport layer connection having a second assignedpriority.
 29. The system of claim 28, wherein the computed reductionfactor of the first transport layer connection is substantially twice acomputed reduction factor corresponding to the second transport layerconnection.
 30. The system of claim 28, wherein the computed reductionfactor of the first transport layer connection is substantially threetimes a computed reduction factor corresponding to the second transportlayer connection.
 31. The system of claim 23, wherein the network stacktransmits, via the first transport layer connection, an acknowledgementcomprising the second congestion window size.
 32. The system of claim23, wherein the network stack transmits data via a first transport layerconnection having a first assigned priority; and transmits data via asecond transport layer connection having no assigned priority.
 33. Thesystem of claim 32, wherein the reduction factor of the first transportlayer connection is not equal to 2, and the reduction factor of thesecond transport layer connection is equal to
 2. 34. A method fordynamically controlling connection bandwidth by a sender of one or moretransport layer connections according to a priority assigned to one ormore of the transport layer connections, the method comprising: (a)transmitting, by a sender, data via a first transport layer connection,wherein the first transport layer connection has a first congestionwindow size identifying an amount of data to be transmitted by thesender in the absence of an acknowledgement from a receiver; (b)receiving, by the sender via the first transport layer connection, noindications of packet loss events during a time interval; (c)determining an enlargement factor, the enlargement factor correspondingto a priority assigned by the sender to the first transport layerconnection; (d) computing a second congestion window size, the secondcongestion window size computed with respect to the first congestionwindow size and an enlargement factor; and (e) transmitting, by thesender via the first transport layer connection, data according to thesecond congestion window size.
 35. The method of claim 34, wherein step(a) comprises transmitting, by a sender, data via a first TCPconnection, wherein the first transport layer connection has a firstcongestion window size identifying an amount data to be transmitted bythe sender in the absence of an acknowledgement from a receiver.
 36. Themethod of claim 34, wherein step (b) comprises receiving, by the sender,no indications of packet loss events during a time interval equal to around trip time corresponding to the first transport layer connection.37. The method of claim 34 wherein the enlargement factor is lessthan
 1. 38. The method of claim 34, wherein the enlargement factor isgreater than
 1. 39. The method of claim 34, wherein step (d) comprisescomputing a second congestion window size, the second congestion windowsize equal to the first congestion window size multiplied by theenlargement factor.
 40. The method of claim 34, wherein step (d)comprises computing a second congestion window size, the secondcongestion window size equal to the first congestion window size plus aquantity, wherein the quantity is equal to a maximum packet size of thefirst transport layer connection multiplied by the enlargement factor.41. The method of claim 34, wherein step (d) comprises computing asecond congestion window size, the second congestion window size equalto the first congestion window size multiplied by a minimum round triptime divided by an average round trip time plus a quantity, wherein thequantity is equal to a maximum packet size multiplied by the enlargementfactor.
 42. The method of claim 34, wherein step (a) further comprises:(a-a) transmitting data via a first transport layer connection having afirst priority; and (a-b) transmitting data via a second transport layerconnection having a second priority.
 43. The method of claim 42, whereinthe enlargement factor corresponding to the priority of the firsttransport layer connection is at least twice an enlargement factor ofthe second transport layer connection.
 44. The method of claim 42,wherein the enlargement factor corresponding to the priority of thefirst transport layer connection is at least three times an enlargementfactor of the second transport layer connection.
 45. Acomputer-implemented system for dynamically controlling connectionbandwidth by a sender of one or more transport layer connectionsaccording to a priority assigned to one or more of the transport layerconnections, the system comprising: a network appliance which serves asan intermediary for a first transport layer connection between a senderand a receiver, the network appliance comprising: a packet processingengine which transmits data via a first transport layer connection,wherein the first transport layer connection has a first congestionwindow size identifying an amount data to be transmitted by the senderin the absence of an acknowledgement from a receiver; and receives, viathe first transport layer connection, no indications of packet lossevents during a time interval; a flow controller which determines anenlargement factor, the enlargement factor corresponding to a priorityassigned by the network appliance to the first transport layerconnection; computes a second congestion window size, the secondcongestion window size computed with respect to the first congestionwindow size and an enlargement factor; and transmits, via the firsttransport layer connection, data according to the second congestionwindow size.
 46. The system of claim 45, wherein the packet processingengine transmits, via a first TCP connection, data wherein the firsttransport layer connection has a first congestion window sizeidentifying an amount data to be transmitted by the sender in theabsence of an acknowledgement from a receiver.
 47. The system of claim45, wherein the packet processing engine receives no indications ofpacket loss events during a time interval equal to a round trip timecorresponding to the first transport layer connection.
 48. The system ofclaim 45, wherein the enlargement factor is less than
 1. 49. The systemof claim 45, wherein the enlargement factor is greater than
 1. 50. Thesystem of claim 45, wherein the flow controller computes a secondcongestion window size, the second congestion window size equal to theprevious congestion window size multiplied by the enlargement factor.51. The system of claim 45 wherein the flow controller computes a secondcongestion window size, the second congestion window size equal to thefirst congestion window size plus a quantity, wherein the quantity isequal to a maximum packet size of the first transport layer connectionmultiplied by the enlargement factor.
 52. The system of claim 45,wherein the flow controller computes a second congestion window size,the congestion window size equal to the first congestion window sizemultiplied by a minimum round trip time divided by an average round triptime plus a quantity, wherein the quantity is equal to a maximum packetsize multiplied by the enlargement factor.
 53. The system of claim 45,wherein the packet processing engine transmits data via a firsttransport layer connection having a first priority and transmits datavia a second transport layer connection having a second priority. 54.The system of claim 53, wherein the enlargement factor corresponding tothe connection priority of the first transport layer connection is atleast twice an enlargement factor of the second transport layerconnection.
 55. The system of claim 53, wherein the enlargement factorcorresponding to the priority of the first transport layer connection isat least three times an enlargement factor of the second transport layerconnection.
 56. A computer-implemented system for dynamicallycontrolling connection bandwidth by a sender of one or more transportlayer connections according to a priority assigned to one or more of thetransport layer connections, the system comprising: a network stackwhich transmits data via a first transport layer connection, wherein thefirst transport layer connection has a first congestion window sizeidentifying an amount data to be transmitted by the sender in theabsence of an acknowledgement from a receiver; and receives, via thefirst transport layer connection, no indications of packet loss eventsduring a time interval; a flow controller which determines anenlargement factor, the enlargement factor corresponding to a priorityassigned by the network appliance to the first transport layerconnection; computes a second congestion window size, the secondcongestion window size computed with respect to the first congestionwindow size and an enlargement factor; and transmits, via the firsttransport layer connection, data according to the second congestionwindow size.
 57. The system of claim 56, wherein the network stacktransmits, via a first TCP connection, data wherein the first transportlayer connection has a first congestion window size identifying anamount data to be transmitted by the sender in the absence of anacknowledgement from a receiver.
 58. The system of claim 56, wherein thenetwork stack receives no indications of packet loss events during atime interval equal to a round trip time corresponding to the firsttransport layer connection.
 59. The system of claim 56, wherein theenlargement factor is less than
 1. 60. The system of claim 56, whereinthe enlargement factor is greater than
 1. 61. The system of claim 56,wherein the flow controller computes a second congestion window size,the second congestion window size equal to the previous congestionwindow size multiplied by the enlargement factor.
 62. The system ofclaim 56, wherein the flow controller computes a second congestionwindow size, the second congestion window size equal to the firstcongestion window size plus a quantity, wherein the quantity is equal toa maximum packet size of the first transport layer connection multipliedby the enlargement factor.
 63. The system of claim 56, wherein the flowcontroller computes a second congestion window size, the congestionwindow size equal to the first congestion window size multiplied by aminimum round trip time divided by an average round trip time plus aquantity, wherein the quantity is equal to a maximum packet sizemultiplied by the enlargement factor.
 64. The system of claim 56,wherein the network stack transmits data via a first transport layerconnection having a first priority and transmits data via a secondtransport layer connection having a second priority.
 65. The system ofclaim 64, wherein the enlargement factor corresponding to the priorityof the first transport layer connection is at least twice an enlargementfactor of the second transport layer connection.
 66. The system of claim64, wherein the enlargement factor corresponding to the priority of thefirst transport layer connection is at least three times an enlargementfactor of the second transport layer connection.